Sciweavers

1671 search results - page 292 / 335
» On the Covering Steiner Problem
Sort
View
MOBICOM
2006
ACM
14 years 5 months ago
Stochastic event capture using mobile sensors subject to a quality metric
Mobile sensors cover more area over a period of time than the same number of stationary sensors. However, the quality of coverage achieved by mobile sensors depends on the velocit...
Nabhendra Bisnik, Alhussein A. Abouzeid, Volkan Is...
SIGCOMM
2005
ACM
14 years 4 months ago
Using redundancy to cope with failures in a delay tolerant network
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
Sushant Jain, Michael J. Demmer, Rabin K. Patra, K...
WG
2005
Springer
14 years 4 months ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 11 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
GIS
2004
ACM
15 years 15 hour ago
Algorithms for the placement of diagrams on maps
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
Étienne Schramm, Alexander Wolff, Marc J. v...