170 search results - page 31 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
SIGECOM
2010
ACM
14 years 10 days ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
Plug-in hybrid electric vehicles are expected to place a considerable strain on local electricity distribution networks, requiring charging to be coordinated in order to accommoda...