69 search results - page 14 / 14 » Fast Estimation of Timing Yield Bounds for Process Variation... |
FOCS
1999
IEEE
13 years 10 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
INFOCOM
2000
IEEE
13 years 9 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
SAC
2004
ACM
13 years 11 months ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
FLAIRS
2004
13 years 7 months ago
2004
Intelligent directory assistance is the ability to retrieve relevant subscriber records in the presence of mismatches between the query and the subscriber record. The challenges a...