628 search results - page 89 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
144
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
257
Voted
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
93
Voted
AGILE
2009
Springer
15 years 9 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
147
Voted
ADHOC
2005
15 years 2 months ago
2005
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
141
Voted
ICCAD
1995
IEEE
15 years 6 months ago
1995
IEEE
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...