Sciweavers

6104 search results - page 839 / 1221
» Constructing Information Bases Using Associative Structures
Sort
View
FOCS
2009
IEEE
15 years 12 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
IJCNN
2000
IEEE
15 years 9 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
CORR
2011
Springer
151views Education» more  CORR 2011»
14 years 8 months ago
A New Representation Theorem for Many-valued Modal Logics
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
Zoran Majkic
NIPS
1993
15 years 6 months ago
The Power of Amnesia
We propose a learning algorithm for a variable memory length Markov process. Human communication, whether given as text, handwriting, or speech, has multi characteristic time scal...
Dana Ron, Yoram Singer, Naftali Tishby
SAT
2009
Springer
109views Hardware» more  SAT 2009»
15 years 11 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere