Sciweavers

69 search results - page 12 / 14
» Generic Incremental Algorithms for Local Search
Sort
View
DAC
2005
ACM
14 years 9 months ago
Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method
This paper presents a novel repeater insertion algorithm for the power minimization of realistic interconnect trees under given timing budgets. Our algorithm judiciously combines ...
Yuantao Peng, Xun Liu
ATAL
2009
Springer
14 years 3 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
TCBB
2008
107views more  TCBB 2008»
13 years 8 months ago
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering
It is a consensus in microarray analysis that identifying potential local patterns, characterized by coherent groups of genes and conditions, may shed light on the discovery of pre...
Hyuk Cho, Inderjit S. Dhillon
SDM
2004
SIAM
187views Data Mining» more  SDM 2004»
13 years 10 months ago
Minimum Sum-Squared Residue Co-Clustering of Gene Expression Data
Microarray experiments have been extensively used for simultaneously measuring DNA expression levels of thousands of genes in genome research. A key step in the analysis of gene e...
Hyuk Cho, Inderjit S. Dhillon, Yuqiang Guan, Suvri...
CRV
2005
IEEE
201views Robotics» more  CRV 2005»
14 years 2 months ago
Minimum Bayes Error Features for Visual Recognition by Sequential Feature Selection and Extraction
The extraction of optimal features, in a classification sense, is still quite challenging in the context of large-scale classification problems (such as visual recognition), inv...
Gustavo Carneiro, Nuno Vasconcelos