2421 search results - page 18 / 485 » Approximate Flow-Aware Networking |
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
MTA
2010
14 years 8 months ago
2010
Abstract In this paper we propose a reduced-reference quality assessment algorithm which computes an approximation of the Structural SIMilarity (SSIM) metrics exploiting coding too...
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
121
click to vote
SMC
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...