Sciweavers

6020 search results - page 1124 / 1204
» A New Approach to Model Counting
Sort
View
BMCBI
2002
108views more  BMCBI 2002»
15 years 4 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
CIKM
2010
Springer
15 years 1 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
JMLR
2011
192views more  JMLR 2011»
14 years 11 months ago
Minimum Description Length Penalization for Group and Multi-Task Sparse Learning
We propose a framework MIC (Multiple Inclusion Criterion) for learning sparse models based on the information theoretic Minimum Description Length (MDL) principle. MIC provides an...
Paramveer S. Dhillon, Dean P. Foster, Lyle H. Unga...
COMPGEOM
2011
ACM
14 years 8 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
IWMM
2011
Springer
254views Hardware» more  IWMM 2011»
14 years 7 months ago
Short-term memory for self-collecting mutators
We propose a new memory model called short-term memory for managing objects on the heap. In contrast to the traditional persistent memory model for heap management, objects in sho...
Martin Aigner, Andreas Haas, Christoph M. Kirsch, ...
« Prev « First page 1124 / 1204 Last » Next »