1554 search results - page 253 / 311 » Parameterized Complexity and Approximation Algorithms |
CGF
2007
14 years 12 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
TKDE
2008
14 years 11 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
104
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
ATMOS
2010
14 years 11 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
133
click to vote
IJRR
2010
14 years 10 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...