Sciweavers

438 search results - page 41 / 88
» The forest hiding problem
Sort
View
IJSNET
2010
114views more  IJSNET 2010»
14 years 10 months ago
Wireless sensor networks for soil science
Abstract: Wireless sensor networks can revolutionize soil ecology by providing measurements at temporal and spatial granularities previously impossible. This paper presents our fi...
Andreas Terzis, Razvan Musaloiu-Elefteri, Joshua C...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 10 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 4 days ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
KBSE
2009
IEEE
15 years 6 months ago
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
WETICE
2008
IEEE
15 years 6 months ago
On NAT Traversal in Peer-to-Peer Applications
A widely used technique to overcome the shortage of unique public IP addresses is Network Address Translation (NAT), which hides several hosts behind a single public address. This...
Konstantin Pussep, M. Weinert, Aleksandra Kovacevi...