Sciweavers

872 search results - page 148 / 175
» Extreme lower probabilities
Sort
View
87
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
Non-Preemptive Buffer Management for Latency Sensitive Packets
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
Moran Feldman, Joseph Naor
WINET
2010
105views more  WINET 2010»
14 years 7 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
13 years 9 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff
CVPR
2007
IEEE
15 years 11 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
POPL
2005
ACM
15 years 9 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula