Sciweavers

134 search results - page 10 / 27
» On the Complexity of Approximating the VC Dimension
Sort
View
CIE
2010
Springer
15 years 2 months ago
Approximate Self-assembly of the Sierpinski Triangle
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
Jack H. Lutz, Brad Shutters
EDBT
2008
ACM
124views Database» more  EDBT 2008»
15 years 9 months ago
Multi-dimensional search for personal information management systems
With the explosion in the amount of semi-structured data users access and store in personal information management systems, there is a need for complex search tools to retrieve of...
Amélie Marian, Christopher Peery, Thu D. Ng...
ICALP
2004
Springer
15 years 2 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
15 years 2 months ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
ICIP
2003
IEEE
15 years 11 months ago
Design of Q-shift complex wavelets for image processing using frequency domain energy minimization
This paper proposes a new method of designing finitesupport wavelet filters, based on minimization of energy in key parts of the frequency domain. In particular this technique is ...
Nick G. Kingsbury