9572 search results - page 267 / 1915 » Cover Algorithms and Their Combination |
180
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
171
click to vote
GIS
2006
ACM
15 years 6 months ago
2006
ACM
This paper tackles a major privacy threat in current location-based services where users have to report their exact locations to the database server in order to obtain their desir...
175
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
186
click to vote
I3E
2008
15 years 8 months ago
2008
Abstract. Many e-commerce sites use a recommendation system to filter the specific information that a user wants out of an overload of information. Currently, the usefulness of the...
179
click to vote
TALG
2008
15 years 6 months ago
2008
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...