Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
12 years 2 months ago
RFQ: Redemptive Fair Queuing
Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. V...
Ajay Gulati, Peter J. Varman
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
12 years 3 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
12 years 3 months ago
Flexible Path Planning Using Corridor Maps
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
Mark H. Overmars, Ioannis Karamouzas, Roland Gerae...
ESA
2008
Springer
129views Algorithms» more  ESA 2008»
12 years 3 months ago
More Robust Hashing: Cuckoo Hashing with a Stash
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there...
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
12 years 3 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre
ESA
2008
Springer
81views Algorithms» more  ESA 2008»
12 years 3 months ago
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
Pankaj K. Agarwal, Jeff M. Phillips
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
12 years 3 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
ESA
2008
Springer
94views Algorithms» more  ESA 2008»
12 years 3 months ago
Relative Convex Hulls in Semi-dynamic Subdivisions
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
Mashhood Ishaque, Csaba D. Tóth
ESA
2008
Springer
101views Algorithms» more  ESA 2008»
12 years 3 months ago
Faster Steiner Tree Computation in Polynomial-Space
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
books