Sciweavers

7930 search results - page 25 / 1586
» Greedy in Approximation Algorithms
Sort
View
CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 7 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman
INFOCOM
2007
IEEE
14 years 1 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
INFOCOM
2006
IEEE
14 years 1 months ago
Adaptive Admission Control Algorithm for Multiuser OFDMA Wireless Networks
—We propose a new adaptive admission control scheme for multiuser OFDMA systems to allocate wireless resource with low complexity. In this adaptive admission control scheme, the ...
Kyung-Ho Sohn, Jongkyung Kim, Tae Sung Kim, Young ...
PODS
2003
ACM
132views Database» more  PODS 2003»
14 years 7 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
TROB
2010
58views more  TROB 2010»
13 years 5 months ago
Localization: Approximation and Performance Bounds to Minimize Travel Distance
Abstract—Localization, which is the determination of one’s location in a known terrain, is a fundamental task for autonomous robots. This paper presents several new basic theor...
Craig A. Tovey, Sven Koenig