448 search results - page 31 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
BIRTHDAY
2009
Springer
14 years 21 days ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...