Sciweavers

220 search results - page 4 / 44
» Using Difference Reduction for Generic Proof Search
Sort
View
CVPR
1999
IEEE
14 years 10 months ago
High-Level and Generic Models for Visual Search: When Does High Level Knowledge Help?
We analyze the problem of detecting a road target in background clutter and investigate the amount of prior (i.e. target specific) knowledge needed to perform this search task. Th...
Alan L. Yuille, James M. Coughlan
AAAI
2007
13 years 10 months ago
Search Space Reduction and Russian Doll Search
In a constraint optimization problem (COP), many feasible valuations lead to the same objective value. This often means a huge search space and poor performance in the propagation...
Kenil C. K. Cheng, Roland H. C. Yap
CVPR
2007
IEEE
14 years 10 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
FROCOS
2011
Springer
12 years 7 months ago
Automatic Proof and Disproof in Isabelle/HOL
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
Jasmin Christian Blanchette, Lukas Bulwahn, Tobias...
SIAMCOMP
2000
76views more  SIAMCOMP 2000»
13 years 7 months ago
On Interpolation and Automatization for Frege Systems
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
Maria Luisa Bonet, Toniann Pitassi, Ran Raz