1722 search results - page 237 / 345 » On the sample mean of graphs |
185
click to vote
APPROX
2009
Springer
16 years 28 days ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
160
click to vote
KBSE
2007
IEEE
16 years 18 days ago
2007
IEEE
Flexibility and interoperability make web services well suited for designing highly-customizable reactive service-based applications, that is interactive applications that can be ...
154
click to vote
CCS
2007
ACM
16 years 15 days ago
2007
ACM
The paper describes a Non-Intrusive IP traceback scheme which uses sampled traffic under non-attack conditions to build and maintains caches of the valid source addresses transiti...
201
click to vote
MSWIM
2006
ACM
16 years 9 days ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
166
click to vote
IPPS
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...