Sciweavers

FAW
2010
Springer
225views Algorithms» more  FAW 2010»
13 years 11 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
FAW
2010
Springer
205views Algorithms» more  FAW 2010»
13 years 11 months ago
Progress on Certifying Algorithms
Kurt Mehlhorn, Pascal Schweitzer
ESA
2010
Springer
136views Algorithms» more  ESA 2010»
13 years 11 months ago
Volume in General Metric Spaces
Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J...
ESA
2010
Springer
179views Algorithms» more  ESA 2010»
13 years 11 months ago
On Space Efficient Two Dimensional Range Minimum Data Structures
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
Gerth Stølting Brodal, Pooya Davoodi, S. Sr...
ESA
2010
Springer
151views Algorithms» more  ESA 2010»
13 years 11 months ago
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract)
Deepak Ajwani, Nodari Sitchinava, Norbert Zeh
ESA
2010
Springer
149views Algorithms» more  ESA 2010»
13 years 11 months ago
Fast Prefix Search in Little Space, with Applications
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 11 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
13 years 11 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
ESA
2010
Springer
149views Algorithms» more  ESA 2010»
13 years 11 months ago
Non-clairvoyant Speed Scaling for Weighted Flow Time
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow ti...
Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
13 years 11 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang