Sciweavers

957 search results - page 47 / 192
» From Margin to Sparsity
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 3 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
BMCBI
2007
143views more  BMCBI 2007»
13 years 8 months ago
Factor analysis for gene regulatory networks and transcription factor activity profiles
Background: Most existing algorithms for the inference of the structure of gene regulatory networks from gene expression data assume that the activity levels of transcription fact...
Iosifina Pournara, Lorenz Wernisch
AAAI
2008
13 years 10 months ago
Integrating Multiple Learning Components through Markov Logic
This paper addresses the question of how statistical learning algorithms can be integrated into a larger AI system both from a practical engineering perspective and from the persp...
Thomas G. Dietterich, Xinlong Bao
ECCV
2004
Springer
14 years 9 months ago
Sparse Finite Elements for Geodesic Contours with Level-Sets
Level-set methods have been shown to be an effective way to solve optimisation problems that involve closed curves. They are well known for their capacity to deal with flexible top...
Martin Weber, Andrew Blake, Roberto Cipolla
ICASSP
2009
IEEE
14 years 2 months ago
Analyzing Least Squares and Kalman Filtered Compressed Sensing
In recent work, we studied the problem of causally reconstructing time sequences of spatially sparse signals, with unknown and slow time-varying sparsity patterns, from a limited ...
Namrata Vaswani