2694 search results - page 439 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
117
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
123
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
129
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
113
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
142
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...