Sciweavers

5595 search results - page 203 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SDM
2007
SIAM
152views Data Mining» more  SDM 2007»
15 years 7 months ago
HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer Clustering
In distributed data mining models, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose...
Khaled M. Hammouda, Mohamed S. Kamel
ICCV
2007
IEEE
16 years 8 months ago
Mode-seeking by Medoidshifts
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
Yaser Sheikh, Erum A. Khan, Takeo Kanade
ISITA
2010
15 years 4 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
FOCM
2008
76views more  FOCM 2008»
15 years 6 months ago
On Smale's 17th Problem: A Probabilistic Positive Solution
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
Carlos Beltrán, Luis Miguel Pardo