2004 search results - page 159 / 401 » Sampling from large graphs |
157
click to vote
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
162
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
107
Voted
LCN
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
104
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Trajectory methods sample the state trajectory of a circuit as it simulates in the time domain, and build macromodels by reducing and interpolating among the linearizations create...
142
Voted
CLIN
2001
15 years 4 months ago
2001
Two major stages stages in language identification systems can be identified: the language modeling stage, where the distinctive features of languages are determined and stored in...