Sciweavers

1088 search results - page 102 / 218
» Independence of Negative Constraints
Sort
View
DAC
2009
ACM
15 years 11 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
ICML
2007
IEEE
15 years 10 months ago
Focused crawling with scalable ordinal regression solvers
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
Rashmin Babaria, J. Saketha Nath, S. Krishnan, K. ...
ICML
2007
IEEE
15 years 10 months ago
Sparse eigen methods by D.C. programming
Eigenvalue problems are rampant in machine learning and statistics and appear in the context of classification, dimensionality reduction, etc. In this paper, we consider a cardina...
Bharath K. Sriperumbudur, David A. Torres, Gert R....
ICLP
2009
Springer
15 years 10 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
Global Illumination Compensation for Spatially Augmented Reality
When projectors are used to display images on complex, non-planar surface geometry, indirect illumination between the surfaces will disrupt the final appearance of this imagery, ...
Yu Sheng, Theodore C. Yapo, Barbara Cutler