3134 search results - page 98 / 627 » Computing full disjunctions |
100
click to vote
COCO
1991
Springer
15 years 6 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
140
Voted
CCS
2008
ACM
15 years 4 months ago
2008
ACM
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
115
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
152
click to vote
ML
2000
ACM
15 years 2 months ago
2000
ACM
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
151
Voted
ASE
2011
14 years 6 months ago
2011
Abstract To improve software quality, static or dynamic defect-detection tools accept programming rules as input and detect their violations in software as defects. As these progra...