Sciweavers

137 search results - page 21 / 28
» Clustering in Trees: Optimizing Cluster Sizes and Number of ...
Sort
View
CLUSTER
2008
IEEE
13 years 9 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
13 years 8 months ago
Evolutionary facial feature selection
With the growing number of acquired physiological and behavioral biometric samples, biometric data sets are experiencing tremendous growth. As database sizes increase, exhaustive ...
Aaron K. Baughman
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
13 years 11 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
ICASSP
2011
IEEE
12 years 11 months ago
Blind separation of multiple binary sources from one nonlinear mixture
We propose a new method for the blind separation of multiple binary signals from a single general nonlinear mixture. In addition to the usual independence assumption on the input ...
Konstantinos I. Diamantaras, Theophilos Papadimitr...
PAMI
2010
112views more  PAMI 2010»
13 years 5 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum