239 search results - page 23 / 48 » A Simple Algorithm for Computing the Lempel Ziv Factorizatio... |
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
TON
2002
13 years 7 months ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
SIGECOM
2010
ACM
14 years 6 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
ASSETS
2005
ACM
13 years 9 months ago
2005
ACM
The possibility of pre-compensating images in a computer display according to the visual aberrations previously assessed in an optical system (e.g., the computer user’s eye) has...
COMPGEOM
1998
ACM
13 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...