Sciweavers

1399 search results - page 74 / 280
» New Algorithms for k-Center and Extensions
Sort
View
ICASSP
2011
IEEE
13 years 26 days ago
On optimal precoding in wireless multicast systems
Precoding has been extensively studied for point-to-point communications, including the problems of constructing the precoding codebook and selecting the best precoder. This paper...
Yiyue Wu, Haipeng Zheng, A. Robert Calderbank, San...
CIC
2004
118views Communications» more  CIC 2004»
13 years 10 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
ICNP
2007
IEEE
14 years 3 months ago
Adaptive Optimization of Rate Adaptation Algorithms in Multi-Rate WLANs
— Rate adaptation is one of the basic functionalities in today’s 802.11 wireless LANs (WLANs). Although it is primarily designed to cope with the variability of wireless channe...
Jaehyuk Choi, Jongkeun Na, Kihong Park, Chong-kwon...
JAIR
2008
103views more  JAIR 2008»
13 years 9 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 9 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis