111 search results - page 18 / 23 » Randomized computations on large data sets: tight lower boun... |
WSNA
2003
ACM
14 years 21 days ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
COR
2006
13 years 7 months ago
2006
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...