Sciweavers

653 search results - page 102 / 131
» The size of minimum 3-trees
Sort
View
ISCAS
2002
IEEE
108views Hardware» more  ISCAS 2002»
15 years 4 months ago
Optimal adaptive bandwidth monitoring for QoS based retrieval
—Network aware multimedia delivery applications are a class of applications that provide certain level of quality of service (QoS) guarantees to end users while not assuming unde...
Yinzhe Yu, Anup Basu, Irene Cheng
STACS
2001
Springer
15 years 4 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
ICPR
2000
IEEE
15 years 4 months ago
3-D Object Reconstruction Using Spatially Extended Voxels and Multi-Hypothesis Voxel Coloring
In this paper we describe a voxel-based 3-D reconstruction technique from multiple calibrated camera views that makes explicit use of the finite size footprint of a voxel when pr...
Eckehard G. Steinbach, Bernd Girod, Peter Eisert, ...
IPPS
2000
IEEE
15 years 4 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
CIAC
2000
Springer
105views Algorithms» more  CIAC 2000»
15 years 4 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