91 search results - page 11 / 19 » Bounding the Size of k-Tuple Covers |
WADS
2007
Springer
15 years 3 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
121
click to vote
PAMI
2012
13 years 7 days ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
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...
111
click to vote
ISSRE
2003
IEEE
15 years 3 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...