451 search results - page 68 / 91 » On Parameterized Exponential Time Complexity |
SIGGRAPH
1991
ACM
14 years 1 months ago
1991
ACM
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies...
CGF
1998
13 years 9 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...
PVLDB
2010
13 years 8 months ago
2010
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Identification of time-varying linear systems, which introduce both time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task in many engineering applications...
AAAI
2011
12 years 10 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...