Sciweavers

330 search results - page 28 / 66
» Algorithms for Propositional Model Counting
Sort
View
CP
2010
Springer
14 years 8 months ago
Computing the Density of States of Boolean Formulas
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
Stefano Ermon, Carla P. Gomes, Bart Selman
ILP
2003
Springer
15 years 2 months ago
Relational IBL in Music with a New Structural Similarity Measure
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
Asmir Tobudic, Gerhard Widmer
CSL
2010
Springer
14 years 10 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
DIS
2007
Springer
15 years 3 months ago
Machine Learning in Ecosystem Informatics
Ecosystem Informatics brings together mathematical and computational tools to address scientific and policy challenges in the ecosystem sciences. These challenges include novel s...
Thomas G. Dietterich
CVPR
2003
IEEE
15 years 11 months ago
Finding and Tracking People from the Bottom Up
We describe a tracker that can track moving people in long sequences without manual initialization. Moving people are modeled with the assumption that, while configuration can var...
Deva Ramanan, David A. Forsyth