13603 search results - page 2369 / 2721 » On the Complexity of Computing Treelength |
177
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
211
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
201
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
199
click to vote
DAS
2008
Springer
15 years 8 months ago
2008
Springer
Both graphic text and scene text detection in video images with complex background and low resolution is still a challenging and interesting problem for researchers in the field o...
163
click to vote
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...