Sciweavers

5595 search results - page 402 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
APBC
2003
15 years 8 months ago
Microarray Image Processing Based on Clustering and Morphological Analysis
Microarrays allow the monitoring of expressions for tens of thousands of genes simultaneously. Image analysis is an important aspect for microarray experiments that can affect sub...
Shuanhu Wu, Hong Yan
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 8 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
CLEF
2010
Springer
15 years 8 months ago
Using Web Graph Structure for Person Name Disambiguation
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
Elena Smirnova, Konstantin Avrachenkov, Brigitte T...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
CPAIOR
2005
Springer
16 years 10 days ago
Filtering Algorithms for the NValue Constraint
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
Christian Bessière, Emmanuel Hebrard, Brahi...