Sciweavers

575 search results - page 1 / 115
» A Spectral Approach to Lower Bounds
Sort
View
FOCS
1994
IEEE
13 years 9 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle
IPCO
1993
98views Optimization» more  IPCO 1993»
13 years 6 months ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
WG
2000
Springer
13 years 8 months ago
New Spectral Lower Bounds on the Bisection Width of Graphs
Sergei L. Bezrukov, Robert Elsässer, Burkhard...
ICCV
2009
IEEE
1119views Computer Vision» more  ICCV 2009»
14 years 10 months ago
Spectral clustering of linear subspaces for motion segmentation
This paper studies automatic segmentation of multiple motions from tracked feature points through spectral embedding and clustering of linear subspaces. We show that the dimensi...
Fabien Lauer, Christoph Schn¨orr
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
13 years 10 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez