1082 search results - page 84 / 217 » Approximation Algorithms for Spreading Points |
SIGMOD
1998
ACM
14 years 1 months ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
STOC
2010
ACM
14 years 6 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
WAOA
2010
Springer
13 years 6 months ago
2010
Springer
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
ICASSP
2011
IEEE
13 years 21 days ago
2011
IEEE
The paper addresses the convergence of a decentralized Robbins-Monro algorithm for networks of agents. This algorithm combines local stochastic approximation steps for finding th...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
In this paper we considerably improve on a state-of-theart alpha matting approach by incorporating a new prior which is based on the image formation process. In particular, we mod...