Sciweavers

ESA
2000
Springer
110views Algorithms» more  ESA 2000»
14 years 3 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
14 years 3 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
DIALM
2000
ACM
107views Algorithms» more  DIALM 2000»
14 years 3 months ago
Efficient memoryless protocol for tag identification
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
Ching Law, Kayi Lee, Kai-Yeung Siu
DIALM
2000
ACM
75views Algorithms» more  DIALM 2000»
14 years 3 months ago
Energy-efficient randomized routing in radio networks
Koji Nakano, Stephan Olariu
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
14 years 3 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
14 years 3 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
FUN
2010
Springer
219views Algorithms» more  FUN 2010»
14 years 3 months ago
The Magic of a Number System
We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
CIAC
2003
Springer
142views Algorithms» more  CIAC 2003»
14 years 3 months ago
Differential Approximation for Some Routing Problems
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
Cristina Bazgan, Refael Hassin, Jérôm...
ASIAN
2003
Springer
126views Algorithms» more  ASIAN 2003»
14 years 3 months ago
Information Flow Security for XML Transformations
Abstract. We provide a formal definition of information flows in XML transformations and, more generally, in the presence of type driven computations and describe a sound technique...
Véronique Benzaken, Marwan Burelle, Giusepp...
ASPDAC
2001
ACM
82views Hardware» more  ASPDAC 2001»
14 years 3 months ago
Towards the logic defect diagnosis for partial-scan designs
Loical defect diagnosis is a critical yet challenging process in VLSI manufacturing. It involves the identification of the defect spots in a logic IC that fails testing. In the la...
Shi-Yu Huang