Sciweavers

350 search results - page 41 / 70
» Approximation Algorithms for Unique Games
Sort
View
ADHOCNOW
2008
Springer
14 years 1 months ago
Utility-Based Uplink Power Control in CDMA Wireless Networks with Real-Time Services
In this paper we address the problem of efficient power allocation in the uplink of CDMA wireless networks, emphasizing on the support of realtime services’ QoS prerequisites. Th...
Timotheos Kastrinogiannis, Eirini-Eleni Tsiropoulo...
WINE
2010
Springer
201views Economy» more  WINE 2010»
13 years 5 months ago
Efficient Computation of the Shapley Value for Centrality in Networks
The Shapley Value is arguably the most important normative solution concept in coalitional games. One of its applications is in the domain of networks, where the Shapley Value is u...
Karthik V. Aadithya, Balaraman Ravindran, Tomasz P...
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 9 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
MOBIHOC
2012
ACM
11 years 10 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
CCCG
2006
13 years 9 months ago
Shortest Descending Paths through Given Faces
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw