Sciweavers

2192 search results - page 357 / 439
» Algorithms for Challenging Motif Problems
Sort
View
DAC
2004
ACM
14 years 9 months ago
ORACLE: optimization with recourse of analog circuits including layout extraction
Long design cycles due to the inability to predict silicon realities is a well-known problem that plagues analog/RF integrated circuit product development. As this problem worsens...
Yang Xu, Lawrence T. Pileggi, Stephen P. Boyd
WWW
2008
ACM
14 years 8 months ago
WWW 2008 workshop: NLPIX2008 summary
The amount of information available on the Web has increased rapidly, reaching levels that few would ever have imagined possible. We live in what could be called the "informa...
Hiroshi Nakagawa, Kentaro Torisawa, Marasu Kitsure...
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 2 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 2 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
ACCV
2006
Springer
14 years 2 months ago
Dense Motion and Disparity Estimation Via Loopy Belief Propagation
We describe a method for computing a dense estimate of motion and disparity, given a stereo video sequence containing moving non-rigid objects. In contrast to previous approaches, ...
Michael Isard, John MacCormick