Sciweavers

1013 search results - page 140 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Correspondence Free Registration through a Point-to-Model Distance Minimization
This paper presents a novel formulation, which derives in a smooth minimization problem, to tackle the rigid registration between a given point set and a model set. Unlike most of ...
Mohammad Rouhani and Angel D. Sappa
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
14 years 1 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
ICMCS
2007
IEEE
127views Multimedia» more  ICMCS 2007»
14 years 3 months ago
Joint Motion and Color Statistical Video Processing for Motion Segmentation
Vast amounts of digital multimedia data are being produced and distributed today, so methods for the efficient and reliable extraction of information from video data are becoming...
Alexia Briassouli, Vasileios Mezaris, Yiannis Komp...
TASLP
2010
102views more  TASLP 2010»
13 years 7 months ago
Representing Musical Sounds With an Interpolating State Model
—A computationally efficient algorithm is proposed for modeling and representing time-varying musical sounds. The aim is to encode individual sounds and not the statistical prop...
Anssi Klapuri, Tuomas Virtanen
CCGRID
2006
IEEE
14 years 3 months ago
Optimal Replica Placement Strategy for Hierarchical Data Grid Systems
Grid computing is an important mechanism for utilizing distributed computing resources. These resources are distributed in different geographical locations, but are organized to p...
Pangfeng Liu, Jan-Jan Wu