Sciweavers

5595 search results - page 391 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
CCCG
2010
15 years 8 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang
ICASSP
2010
IEEE
15 years 7 months ago
Song-level multi-pitch tracking by heavily constrained clustering
Given a set of monophonic, harmonic sound sources (e.g. human voices or wind instruments), multi-pitch estimation (MPE) is the task of determining the instantaneous pitches of eac...
Zhiyao Duan, Jinyu Han, Bryan Pardo
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
13 years 9 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 7 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
BIOINFORMATICS
2011
15 years 1 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
Haitao Jiang, Binhai Zhu, Daming Zhu