Sciweavers

670 search results - page 94 / 134
» Intractability and clustering with constraints
Sort
View
DAC
2010
ACM
14 years 11 months ago
Detecting tangled logic structures in VLSI netlists
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
Tanuj Jindal, Charles J. Alpert, Jiang Hu, Zhuo Li...
BMCBI
2008
178views more  BMCBI 2008»
14 years 10 months ago
Identification of coherent patterns in gene expression data using an efficient biclustering algorithm and parallel coordinate vi
Background: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes ...
Kin-On Cheng, Ngai-Fong Law, Wan-Chi Siu, Alan Wee...
ICML
2007
IEEE
15 years 10 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
ICML
2008
IEEE
15 years 10 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
GFKL
2007
Springer
148views Data Mining» more  GFKL 2007»
15 years 3 months ago
Information Integration of Partially Labeled Data
Abstract. A central task when integrating data from different sources is to detect identical items. For example, price comparison websites have to identify offers for identical p...
Steffen Rendle, Lars Schmidt-Thieme