Sciweavers

Share
ALGORITHMICA
2005
63views more  ALGORITHMICA 2005»
8 years 6 months ago
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
ALGORITHMICA
2005
102views more  ALGORITHMICA 2005»
8 years 6 months ago
Effective Routing and Scheduling in Adversarial Queueing Networks
In an adversarial queueing network, the incoming traffic is decided by an adversary, who operates under a reasonable rate restriction. This model provides a valuable, complementar...
Jay Sethuraman, Chung-Piaw Teo
ALGORITHMICA
2005
129views more  ALGORITHMICA 2005»
8 years 6 months ago
A Comparison of Multicast Pull Models
We consider the setting of a web server that receives requests for documents from clients, and returns the requested documents over a multicast/broadcast channel. We compare the q...
Kirk Pruhs, Patchrawat Uthaisombut
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
8 years 6 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
ALGORITHMICA
2005
84views more  ALGORITHMICA 2005»
8 years 6 months ago
Optimal Read-Once Parallel Disk Scheduling
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
Mahesh Kallahalla, Peter J. Varman
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
8 years 6 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
8 years 6 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
8 years 6 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
ALGORITHMICA
2005
76views more  ALGORITHMICA 2005»
8 years 6 months ago
Characterizing History Independent Data Structures
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
Jason D. Hartline, Edwin S. Hong, Alexander E. Moh...
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
8 years 6 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
books