1503 search results - page 124 / 301 » Self-optimizing distributed trees |
ISPD
2004
ACM
14 years 3 months ago
2004
ACM
Modern processors and SoCs require the adoption of poweroriented design styles, due to the implications that power consumption may have on reliability, cost and manufacturability ...
FSTTCS
2007
Springer
14 years 4 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
CIAC
2000
Springer
14 years 2 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
CIKM
2008
Springer
14 years 1 days ago
2008
Springer
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...