3894 search results - page 701 / 779 » Approximation Algorithms for Biclustering Problems |
142
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
138
click to vote
MOBIHOC
2008
ACM
16 years 2 months ago
2008
ACM
Relay-enabled wireless networks (eg. WIMAX 802.16j) represent an emerging trend for the incorporation of multi-hop networking solutions for last-mile broadband access in next gene...
121
click to vote
SODA
2010
ACM
16 years 17 days ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
148
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
156
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...