2370 search results - page 186 / 474 » The Characterization of Data-Accumulating Algorithms |
72
Voted
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
64
Voted
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
Abstract. Traditional clustering algorithms are based on one representation space, usually a vector space. However, in a variety of modern applications, multiple representations ex...
81
Voted
ITC
2003
IEEE
15 years 3 months ago
2003
IEEE
A technique to derive test vectors that exercise the worstcase delay effects in a domino circuit in the presence of crosstalk is described. A model for characterizing the delay of...
102
Voted
RTAS
2003
IEEE
15 years 3 months ago
2003
IEEE
A reward-based task typically consists of a mandatory part that must be accomplished before the given deadline, and an optional part that is associated with rewards for partial co...
99
Voted
RTSS
2003
IEEE
15 years 3 months ago
2003
IEEE
We address the problem of providing compositional hard real-time guarantees in a hierarchy of schedulers. We first propose a resource model to characterize a periodic resource al...