721 search results - page 63 / 145 » Almost universal graphs |
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Forecasting sequences by expert ensembles generally assumes stationary or near-stationary processes; however, in complex systems and many real-world applications, we are frequentl...
197
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
105
click to vote
MCS
2010
Springer
15 years 1 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...