Sciweavers

312 search results - page 53 / 63
» Iterative compression and exact algorithms
Sort
View
DAC
2006
ACM
14 years 10 months ago
Circuit simulation based obstacle-aware Steiner routing
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
Yiyu Shi, Paul Mesa, Hao Yu, Lei He
ICML
2004
IEEE
14 years 10 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
IJCNN
2007
IEEE
14 years 4 months ago
Analyzing the Fuzzy ARTMAP Matchtracking mechanism with Co-Objective Optimization Theory
— In the process of learning a pattern I, the Fuzzy ARTMAP algorithm templates (i.e., the weight vectors corresponding to nodes of its category representation layer) compete for ...
José Castro, Michael Georgiopoulos, Jimmy S...
ICML
2010
IEEE
13 years 11 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 9 months ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel