2272 search results - page 4 / 455 » Capture Complexity by Partition |
ECCC
2006
13 years 7 months ago
2006
We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence ...
ETS
2002
IEEE
13 years 7 months ago
2002
IEEE
SIGACT
2000
13 years 7 months ago
2000
VRST
2009
ACM
14 years 1 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
COCOON
2005
Springer
14 years 28 days ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...