7259 search results - page 1428 / 1452 » From Fields to Trees |
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
DSN
2002
IEEE
14 years 29 days ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
ICDM
2002
IEEE
14 years 29 days ago
2002
IEEE
In this paper, we devise an efficient algorithm for clustering market-basket data. Different from those of the traditional data, the features of market-basket data are known to b...
INFOCOM
2002
IEEE
14 years 28 days ago
2002
IEEE
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...
MICRO
2002
IEEE
14 years 28 days ago
2002
IEEE
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...