Sciweavers

1507 search results - page 43 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 7 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
CSL
2001
Springer
14 years 2 months ago
Capture Complexity by Partition
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
Yijia Chen, Enshao Shen
ICRA
2006
IEEE
93views Robotics» more  ICRA 2006»
14 years 3 months ago
Motion Planning for a Class of Planar Closed-chain Manipulators
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
Guanfeng Liu, Jeffrey C. Trinkle, N. Shvalb
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
14 years 2 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya
JMLR
2002
90views more  JMLR 2002»
13 years 9 months ago
Machine Learning with Data Dependent Hypothesis Classes
We extend the VC theory of statistical learning to data dependent spaces of classifiers. This theory can be viewed as a decomposition of classifier design into two components; the...
Adam Cannon, J. Mark Ettinger, Don R. Hush, Clint ...