Sciweavers

1301 search results - page 10 / 261
» Bounded Version Vectors
Sort
View
73
Voted
SGP
2007
15 years 2 months ago
Fast normal vector compression with bounded error
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
Eric J. Griffith, Michal Koutek, Frits H. Post
JACM
2002
87views more  JACM 2002»
14 years 11 months ago
Bounded concurrent timestamp systems using vector clocks
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
Sibsankar Haldar, Paul M. B. Vitányi
113
Voted
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 5 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...