97 search results - page 12 / 20 » Tight lower bounds for halfspace range searching |
191
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
170
click to vote
ATAL
2009
Springer
16 years 17 days ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
139
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
171
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
143
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...