Sciweavers

1059 search results - page 90 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
CORR
2007
Springer
183views Education» more  CORR 2007»
15 years 1 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
BMCBI
2006
138views more  BMCBI 2006»
15 years 1 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 8 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 9 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
CVPR
2005
IEEE
16 years 3 months ago
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang