209 search results - page 22 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
152
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
97
Voted
IWCIA
2004
Springer
15 years 9 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
161
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
152
Voted
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
148
click to vote
LCN
2006
IEEE
15 years 10 months ago
2006
IEEE
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...