Sciweavers

1650 search results - page 159 / 330
» The HOM problem is decidable
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 8 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
IJCAI
1989
15 years 5 months ago
Recognizing Unnecessary Inference
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
Dan Benanav
CVPR
2006
IEEE
16 years 6 months ago
Learning Object Shape: From Drawings to Images
We consider the important challenge of recognizing a variety of deformable object classes in images. Of fundamental importance and particular difficulty in this setting is the pro...
Gal Elidan, Geremy Heitz, Daphne Koller
ICPR
2004
IEEE
16 years 5 months ago
Probabilistic Classification Between Foreground Objects and Background
Tracking of deformable objects like humans is a basic operation in many surveillance applications. Objects are detected as they enter the field of view of the camera and they are ...
Paul J. Withagen, Klamer Schutte, Frans C. A. Groe...
SIGMOD
2003
ACM
154views Database» more  SIGMOD 2003»
16 years 4 months ago
The Cougar Project: a work-in-progress report
We present an update on the status of the Cougar Sensor Database Project, in which we are investigating a database approach to sensor networks: Clients "program" the sen...
Alan J. Demers, Johannes Gehrke, Rajmohan Rajarama...