Sciweavers

608 search results - page 97 / 122
» On Dependent Randomized Rounding Algorithms
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Dynamic data compression for wireless transmission over a fading channel
—We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where bo...
Michael J. Neely
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
SIGCOMM
2004
ACM
14 years 1 months ago
Delayed stability and performance of distributed congestion control
Recent research efforts to design better Internet transport protocols combined with scalable Active Queue Management (AQM) have led to significant advances in congestion control...
Yueping Zhang, Seong-ryong Kang, Dmitri Loguinov
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
14 years 1 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
14 years 18 hour ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria