387 search results - page 34 / 78 » Many Random Walks Are Faster Than One |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Large linguistic databases, especially databases having a global coverage such as The World Atlas of Language Structures (Haspelmath et al. 2005), The Automated Simility Judgment ...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
PAKDD
2009
ACM
14 years 6 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
WSC
2008
13 years 11 months ago
2008
Multitrajectory simulation allows explicit management of random events by allowing particular events to be resolved by random draw, by a deterministic choice, or by creating new s...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...