1554 search results - page 211 / 311 » Parameterized Complexity and Approximation Algorithms |
166
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
114
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
116
click to vote
MICAI
2007
Springer
15 years 9 months ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
136
click to vote
SI3D
2006
ACM
15 years 9 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
131
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...