Sciweavers

584 search results - page 9 / 117
» On Applying Set Covering Models to Test Set Compaction
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Compact approximations to Bayesian predictive distributions
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...
Edward Snelson, Zoubin Ghahramani
ACTA
2007
92views more  ACTA 2007»
13 years 7 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
INTERACT
2003
13 years 8 months ago
The New Text and Graphical Input Device: Compact Biometrical Data Acquisition
Abstract: Development of new text and graphical input devices is considered to be important part of humancomputer interaction by many researchers worldwide. Our paper presents our ...
Pen Ondrej Rohlik, Pavel Mautner, Václav Ma...
LPNMR
2005
Springer
14 years 29 days ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 7 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender