182 search results - page 26 / 37 » Simple Generalized Maximum Flow Algorithms |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Gravity model used to model transport flow has proven invaluable in urban planning. Some recent work has proposed to use gravity model to predict user movements in cellular net...
EMSOFT
2011
Springer
12 years 7 months ago
2011
Springer
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...