6274 search results - page 88 / 1255 » From query complexity to computational complexity |
IANDC
2010
13 years 8 months ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
RT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Many disciplines must handle the creation, visualization, and manipulation of huge and complex 3D environments. Examples include large structural and mechanical engineeri...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
CVPR
2005
IEEE
15 years 1 days ago
2005
IEEE
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...