801 search results - page 46 / 161 » Minimal Locked Trees |
VLDB
1990
ACM
15 years 1 months ago
1990
ACM
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
COLT
2004
Springer
15 years 1 months ago
2004
Springer
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
SIAMDM
2002
14 years 9 months ago
2002
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
ISPD
2000
ACM
15 years 2 months ago
2000
ACM
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...