Sciweavers

7 search results - page 1 / 2
» ciac 2000
Sort
View
CIAC
2000
Springer
83views Algorithms» more  CIAC 2000»
13 years 10 months ago
Semantical Counting Circuits
Fabrice Noilhan, Miklos Santha
CIAC
2000
Springer
82views Algorithms» more  CIAC 2000»
13 years 10 months ago
The Online Dial-a-Ride Problem under Reasonable Load
Dietrich Hauptmeier, Sven Oliver Krumke, Jörg...
CIAC
2000
Springer
104views Algorithms» more  CIAC 2000»
13 years 10 months ago
The Online-TSP against Fair Adversaries
Michiel Blom, Sven Oliver Krumke, Willem de Paepe,...
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
13 years 10 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...
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
13 years 10 months ago
Algorithms for a Simple Point Placement Problem
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
Joshua Redstone, Walter L. Ruzzo