Sciweavers

607 search results - page 16 / 122
» Unifying Exact Completions
Sort
View
153
Voted
JMLR
2012
13 years 3 months ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
127
Voted
INFORMS
1998
150views more  INFORMS 1998»
15 years 11 days ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
JSA
2000
175views more  JSA 2000»
15 years 15 days ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
BMCBI
2008
173views more  BMCBI 2008»
15 years 25 days ago
Gene Vector Analysis (Geneva): A unified method to detect differentially-regulated gene sets and similar microarray experiments
Background: Microarray experiments measure changes in the expression of thousands of genes. The resulting lists of genes with changes in expression are then searched for biologica...
Stephen W. Tanner, Pankaj Agarwal
104
Voted
IJAR
2008
83views more  IJAR 2008»
15 years 21 days ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon