1503 search results - page 69 / 301 » Self-optimizing distributed trees |
102
click to vote
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
125
click to vote
PPSN
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
149
Voted
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
135
click to vote
WDAG
2001
Springer
15 years 6 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
107
click to vote
ICPP
1994
IEEE
15 years 6 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...