Sciweavers

1265 search results - page 150 / 253
» Randomized Algorithms and Probabilistic Analysis in Wireless...
Sort
View
FSTTCS
1995
Springer
14 years 19 days ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 6 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...

Publication
167views
13 years 9 months ago
A Network Coding Approach to IP Traceback
Traceback schemes aim at identifying the source(s) of a sequence of packets and the nodes these packets traversed. This is useful for tracing the sources of high volume traffic, e...
Pegah Sattari, Minas Gjoka, Athina Markopoulou
MOBIHOC
2009
ACM
14 years 9 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
INFOCOM
2006
IEEE
14 years 3 months ago
Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
Michael J. Neely