Sciweavers

1261 search results - page 146 / 253
» Approximation algorithms for aligning points
Sort
View
DCG
2008
86views more  DCG 2008»
14 years 10 months ago
Reconstruction Using Witness Complexes
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
Leonidas J. Guibas, Steve Oudot
STACS
2007
Springer
15 years 4 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
PODS
2003
ACM
143views Database» more  PODS 2003»
15 years 10 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
ICIP
2006
IEEE
15 years 11 months ago
Multiscale Image Disparity Estimation using the Quaternion Wavelet Transform
We propose an efficient multiscale image disparity estimation algorithm that estimates the local translations needed to align different regions in two images. The algorithm is bas...
Wai Lam Chan, Hyeokho Choi, Richard G. Baraniuk
CORR
2007
Springer
128views Education» more  CORR 2007»
14 years 10 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...