Sciweavers

6110 search results - page 262 / 1222
» Approximate Computing
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
EUROCRYPT
2005
Springer
16 years 4 days ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
IMC
2006
ACM
16 years 17 days ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
CGF
2008
118views more  CGF 2008»
15 years 6 months ago
Manifold-valued Thin-Plate Splines with Applications in Computer Graphics
We present a generalization of thin-plate splines for interpolation and approximation of manifold-valued data, and demonstrate its usefulness in computer graphics with several app...
Florian Steinke, Matthias Hein, Jan Peters, Bernha...
CVPR
2001
IEEE
16 years 8 months ago
Efficient Computation of Adaptive Threshold Surfaces for Image Binarization
The problem of binarization of gray level images acquired under nonuniform illumination is reconsidered. Yanowitz and Bruckstein proposed to use for image binarization an adaptive...
Ilya Blayvas, Alfred M. Bruckstein, Ron Kimmel