32 search results - page 6 / 7 » Topological Sweeping in Three Dimensions |
SIGCOMM
2005
ACM
13 years 11 months ago
2005
ACM
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
GBRPR
2005
Springer
13 years 11 months ago
2005
Springer
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
COMPGEOM
1997
ACM
13 years 9 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
SMA
2006
ACM
13 years 11 months ago
2006
ACM
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
CAISE
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The purpose of this article is to propose a scalable, topologically and traffic-wise self-adapting approach to a publish/subscribe paradigm for supporting event-based app...