3341 search results - page 242 / 669 » On Bounded Queries and Approximation |
176
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. For high-spee...
154
Voted
IWVF
2001
Springer
15 years 11 months ago
2001
Springer
The paper introduces a new approximation scheme for planar digital curves. This scheme defines an approximating sausage ‘around’ the given digital curve, and calculates a mini...
185
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
240
click to vote
ATAL
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
184
click to vote
IGIS
1994
15 years 10 months ago
1994
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...