2168 search results - page 239 / 434 » Randomized Algorithms and Complexity Theory |
151
click to vote
HT
2010
ACM
15 years 5 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
155
click to vote
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
156
click to vote
COCO
2011
Springer
14 years 3 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
126
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we propose a utility model that accounts for both sales and branding advertisers. We first study the computational complexity of optimization problems related to bo...
131
click to vote
IPSN
2004
Springer
15 years 9 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...