420 search results - page 30 / 84 » Search on High Degree Graphs |
206
Voted
VLDB
2007
ACM
16 years 28 days ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
113
click to vote
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
The capability of multi-objective evolutionary algorithms (MOEAs) to handle premature convergence is critically important when applied to real-world problems. Their highly multi-mo...
126
click to vote
GI
1997
Springer
15 years 4 months ago
1997
Springer
This paper gives an overview of an architecture and search organization for large vocabulary, continuous speech recognition (LVCSR at RWTH). In the rst part of the paper, we descri...
109
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
90
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...