Sciweavers

2490 search results - page 198 / 498
» Complexity of Contextual Reasoning
Sort
View
AAAI
2012
13 years 7 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb
LOGCOM
2007
130views more  LOGCOM 2007»
15 years 4 months ago
A Logic for Concepts and Similarity
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
150
Voted
DISOPT
2007
81views more  DISOPT 2007»
15 years 5 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
CVPR
2007
IEEE
16 years 7 months ago
A boosting regression approach to medical anatomy detection
The state-of-the-art object detection algorithm learns a binary classifier to differentiate the foreground object from the background. Since the detection algorithm exhaustively s...
Shaohua Kevin Zhou, Jinghao Zhou, Dorin Comaniciu
POPL
2010
ACM
16 years 2 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...