Sciweavers

1510 search results - page 136 / 302
» Upper Probabilities and Additivity
Sort
View
COMCOM
2004
112views more  COMCOM 2004»
14 years 10 months ago
Design and analysis of optimal adaptive de-jitter buffers
In order to transfer voice or some other application requiring real-time delivery over a packet network, we need a de-jitter buffer to eliminate delay jitters. An important design...
Gagan L. Choudhury, Robert G. Cole
TNN
1998
114views more  TNN 1998»
14 years 9 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
15 years 10 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
STOC
2006
ACM
92views Algorithms» more  STOC 2006»
15 years 10 months ago
On the importance of idempotence
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICALP
2009
Springer
15 years 10 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor