Sciweavers

1261 search results - page 105 / 253
» Approximation algorithms for aligning points
Sort
View
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 4 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
JCP
2007
118views more  JCP 2007»
14 years 9 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 10 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
ICPR
2004
IEEE
15 years 11 months ago
Gaussian Energy Functions for Registration without Correspondences
A new criterion based on Gaussian fields is introduced and applied to the task of automatic rigid registration of point-sets. The method defines a simple energy function, which is...
Andreas Koschan, Besma R. Abidi, Faysal Boughorbel...
PRL
2007
99views more  PRL 2007»
14 years 9 months ago
Polygonal shape description for recognition of partially occluded objects
We introduce a new method for the recognition of partially occluded objects represented only by their contours. Object description, which stems from the inflection point detectio...
Filip Krolupper, Jan Flusser