Sciweavers

380 search results - page 2 / 76
» A Categorical Setting for Lower Complexity
Sort
View
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 5 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman
DLT
2006
13 years 6 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
14 years 6 months ago
Querying Complex Spatio-Temporal Sequences in Human Motion Databases
Content-based retrieval of spatio-temporal patterns from human motion databases is inherently nontrivial since finding effective distance measures for such data is difficult. These...
Yueguo Chen, Shouxu Jiang, Beng Chin Ooi, Anthony ...
IROS
2009
IEEE
205views Robotics» more  IROS 2009»
14 years 3 days ago
Probabilistic categorization of kitchen objects in table settings with a composite sensor
— In this paper, we investigate the problem of 3D object categorization of objects typically present in kitchen environments, from data acquired using a composite sensor. Our fra...
Zoltan Csaba Marton, Radu Bogdan Rusu, Dominik Jai...
ALT
1998
Springer
13 years 9 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh