4403 search results - page 634 / 881 » Galois Theory of Algorithms |
210
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
241
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
204
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
304
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
193
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...