Sciweavers

109 search results - page 18 / 22
» Classifier Combining Rules Under Independence Assumptions
Sort
View
CL
2000
Springer
13 years 11 months ago
The Taming of the (X)OR
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
Peter Baumgartner, Fabio Massacci
IACR
2011
134views more  IACR 2011»
12 years 6 months ago
Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases
Zero knowledge sets (ZKS) [18] allow a party to commit to a secret set S and then to, non interactively, produce proofs for statements such as x ∈ S or x /∈ S. As recognized in...
Dario Catalano, Dario Fiore
PODS
2006
ACM
156views Database» more  PODS 2006»
14 years 6 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
CRV
2006
IEEE
128views Robotics» more  CRV 2006»
14 years 23 days ago
Local Stereo Matching with Segmentation-based Outlier Rejection
We present a new window-based stereo matching algorithm which focuses on robust outlier rejection during aggregation. The main difficulty for window-based methods lies in determi...
Mark Gerrits, Philippe Bekaert
IWPC
2005
IEEE
14 years 8 days ago
A Qualitative Comparison of Three Aspect Mining Techniques
The fact that crosscutting concerns (aspects) cannot be well modularized in object oriented software is an impediment to program comprehension: the implementation of a concern is ...
Mariano Ceccato, Marius Marin, Kim Mens, Leon Moon...