674 search results - page 3 / 135 » Separating Structure from Interestingness |
COCO
2004
Springer
14 years 3 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
It's often important to analyze shapes as made up of parts. But there are two ways to think of how parts fit together. We can characterize the remainder of a shape after a pa...
IROS
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper presents a beat-counting robot that can count musical beats aloud, i.e., speak “one, two, three, four, one, two, ...” along music, while listening to music by us...
LICS
2000
IEEE
14 years 2 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
EJC
2007
13 years 9 months ago
2007
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid. The purpose of this ...