Sciweavers

1132 search results - page 107 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
DCG
2010
76views more  DCG 2010»
15 years 6 months ago
The Euclidean Distortion of the Lamplighter Group
We show that the cyclic lamplighter group C2 Cn embeds into Hilbert space with distortion O log n . This matches the lower bound proved by Lee, Naor and Peres in [14], answering a...
Tim Austin, Assaf Naor, Alain Valette
CCR
2006
92views more  CCR 2006»
15 years 6 months ago
A cooperative uplink power control scheme for elastic data services in wireless CDMA systems
We consider the uplink power control problem in a single cell CDMA wireless data system. Each user specifies upper and lower QoS bounds. We formulate the considered problem as a g...
George Alyfantis, Stathes Hadjiefthymiades, Lazaro...
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 6 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...