Sciweavers

356 search results - page 3 / 72
» A computational approach to negative priming
Sort
View
DAC
2005
ACM
13 years 9 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
13 years 11 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 1 months ago
Getting Prime Cuts from Skylines over Partially Ordered Domains
: Skyline queries have recently received a lot of attention due to their intuitive query formulation: users can state preferences with respect to several attributes. Unlike numeric...
Wolf-Tilo Balke, Wolf Siberski, Ulrich Güntze...
CVPR
2001
IEEE
14 years 9 months ago
A Weighted Non-Negative Matrix Factorization for Local Representations
This paper presents an improvement of the classical Non-negative Matrix Factorization (NMF) approach, for dealing with local representations of image objects. NMF, when applied to...
David Guillamet, Jordi Vitrià, Marco Bressa...
COLING
2010
13 years 2 months ago
Learning the Scope of Negation via Shallow Semantic Parsing
In this paper we present a simplified shallow semantic parsing approach to learning the scope of negation (SoN). This is done by formulating it as a shallow semantic parsing probl...
Junhui Li, Guodong Zhou, Hongling Wang, Qiaoming Z...