451 search results - page 3 / 91 » Some Lower Bounds on Geometric Separability Problems |
TASLP
2002
13 years 9 months ago
2002
Convolutive blind source separation and adaptive beamforming have a similar goal--extracting a source of interest (or multiple sources) while reducing undesired interferences. A be...
SPAA
2004
ACM
14 years 3 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
STOC
1995
ACM
14 years 1 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...