1486 search results - page 84 / 298 » Algorithms for two-box covering |
133
Voted
FTDB
2011
14 years 7 months ago
2011
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
153
click to vote
MIA
2011
14 years 6 months ago
2011
In this work we propose a comprehensive study of Digital Stent Enhancement (DSE), from the analysis of requirements to the validation of the proposed solution. First, we derive th...
120
click to vote
ADC
2009
Springer
15 years 10 months ago
2009
Springer
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which dete...
158
Voted
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
165
click to vote
MSWIM
2006
ACM
15 years 9 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...