Sciweavers

2421 search results - page 248 / 485
» Approximate Flow-Aware Networking
Sort
View
CCR
2008
83views more  CCR 2008»
15 years 4 months ago
Stability and fairness of explicit congestion control with small buffers
Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottlene...
Frank P. Kelly, Gaurav Raina, Thomas Voice
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 4 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
SPAA
2004
ACM
15 years 9 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
JBCB
2007
161views more  JBCB 2007»
15 years 3 months ago
On Cooperative Quasi-Equilibrium Models of transcriptional Regulation
Mechanistic models for transcriptional regulation are derived using the methods of equilibrium statistical mechanics, to model equilibrating processes that occur at a fast time sc...
Eric Mjolsness
WISEC
2009
ACM
15 years 10 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...