Sciweavers

14548 search results - page 2446 / 2910
» The Optimal Path-Matching Problem
Sort
View
FOCS
2008
IEEE
16 years 2 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
16 years 2 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin
BROADNETS
2007
IEEE
16 years 1 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ICC
2007
IEEE
129views Communications» more  ICC 2007»
16 years 1 months ago
Time Sharing Policy in Wireless Networks for Variable Rate Transmission
— For most of wireless services with variable rate transmission, both average rate and rate oscillation are important performance metrics. One often needs to decide how much rate...
Xiaolu Zhang, Meixia Tao, Chun Sum Ng
INFOCOM
2007
IEEE
16 years 1 months ago
QoS-Driven Power Allocation Over Parallel Fading Channels With Imperfect Channel Estimations in Wireless Networks
— We propose the quality-of-service (QoS) driven power allocation schemes for parallel fading channels when considering imperfect channel estimations. In particular, the parallel...
Jia Tang, Xi Zhang
« Prev « First page 2446 / 2910 Last » Next »