2292 search results - page 172 / 459 » Hierarchical approximation and localization |
170
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
179
click to vote
NECO
2008
15 years 6 months ago
2008
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
175
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
170
click to vote
MOC
2010
15 years 1 months ago
2010
Abstract. We prove pointwise a posteriori error estimates for semi- and fullydiscrete finite element methods for approximating the solution u to a parabolic model problem. Our esti...
302
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...