Sciweavers

18 search results - page 4 / 4
» Circular Chromatic Numbers of Distance Graphs with Distance ...
Sort
View
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 10 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
13 years 10 months ago
Route skyline queries: A multi-preference path planning approach
— In recent years, the research community introduced various methods for processing skyline queries in multidimensional databases. The skyline operator retrieves all objects bein...
Hans-Peter Kriegel, Matthias Renz, Matthias Schube...
AFRIGRAPH
2003
ACM
13 years 9 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...