Sciweavers

1494 search results - page 237 / 299
» Polynomial time algorithms for network information flow
Sort
View
MOBICOM
2010
ACM
13 years 9 months ago
Sybot: an adaptive and mobile spectrum survey system for wifi networks
Information on site-specific spectrum characteristics is essential to evaluate and improve the performance of wireless networks. However, it is usually very costly to obtain accur...
Kyu-Han Kim, Alexander W. Min, Kang G. Shin
CONEXT
2009
ACM
13 years 9 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
PAMI
2012
11 years 11 months ago
Recursive Segmentation and Recognition Templates for Image Parsing
— Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchi...
Long Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan...
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 8 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
14 years 2 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...