946 search results - page 174 / 190 » Spatially-decaying aggregation over a network: model and alg... |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
STOC
2010
ACM
14 years 18 hour ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
ASIAN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
SBIA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
ANSS
2006
IEEE
14 years 1 months ago
2006
IEEE
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...