314 search results - page 32 / 63 » Complete Problems for Dynamic Complexity Classes |
101
Voted
COCO
2008
Springer
14 years 11 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...
101
click to vote
PVLDB
2008
14 years 9 months ago
2008
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
CCE
2008
14 years 9 months ago
2008
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the subject during the last decade. Mo...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...