185 search results - page 19 / 37 » Constructions of Grassmannian Simplices |
81
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
85
Voted
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
WADS
2007
Springer
15 years 4 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 ...
103
click to vote
SCALESPACE
2005
Springer
15 years 3 months ago
2005
Springer
We investigate the use of fractional powers of the Laplacian for signal and image simplification. We focus both on their corresponding variational techniques and parabolic pseudod...
86
Voted
SEFM
2003
IEEE
15 years 3 months ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...