Sciweavers

169 search results - page 7 / 34
» The Golden Ratio Encoder
Sort
View
IPPS
1994
IEEE
14 years 1 months ago
AVL Trees with Relaxed Balance
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
Kim S. Larsen
ICALP
2007
Springer
14 years 1 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
DC
2010
13 years 10 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
JCT
2010
98views more  JCT 2010»
13 years 4 months ago
Lifts of matroid representations over partial fields
There exist several theorems which state that when a matroid is representable over distinct fields 1,..., k, it is also representable over other fields. We prove a theorem, the Li...
Rudi Pendavingh, Stefan H. M. van Zwam
APGV
2004
ACM
164views Visualization» more  APGV 2004»
14 years 3 months ago
Subband encoding of high dynamic range imagery
The transition from traditional 24-bit RGB to high dynamic range (HDR) images is hindered by excessively large file formats with no backwards compatibility. In this paper, we prop...
Greg Ward, Maryann Simmons