Sciweavers

780 search results - page 61 / 156
» Reasoning about sets using redescription mining
Sort
View
FMSD
2006
77views more  FMSD 2006»
15 years 24 days ago
Data structures for symbolic multi-valued model-checking
Multi-valued logics can be effectively used to reason about incomplete and/or inconsistent systems, e.g. during early software requirements or as the systems evolve. In our earlie...
Marsha Chechik, Arie Gurfinkel, Benet Devereux, Al...
CVPR
2011
IEEE
14 years 8 months ago
Recognition Using Visual Phrases
In this paper we introduce visual phrases, complex visual composites like “a person riding a horse”. Visual phrases often display significantly reduced visual complexity comp...
Ali Farhadi, Mohammad Amin Sadeghi
107
Voted
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
15 years 7 months ago
Granularity Conscious Modeling for Probabilistic Databases
The convergence of embedded sensor systems and stream query processing suggests an important role for database techniques, in managing data that only partially – and often inacc...
Eirinaios Michelakis, Daisy Zhe Wang, Minos N. Gar...
CAV
1993
Springer
108views Hardware» more  CAV 1993»
15 years 4 months ago
Computer-Assisted Simulation Proofs
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
Jørgen F. Søgaard-Andersen, Stephen ...
LPNMR
2005
Springer
15 years 6 months ago
Revisiting the Semantics of Interval Probabilistic Logic Programs
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
Alex Dekhtyar, Michael I. Dekhtyar