Sciweavers

1382 search results - page 107 / 277
» Formal Analysis of Online Algorithms
Sort
View
SIGACT
2010
68views more  SIGACT 2010»
15 years 26 days ago
A survey of buffer management policies for packet switches
Over the past decade, there has been great interest in the study of buffer management policies in the context of packet transmission for network switches. In a typical model, a sw...
Michael H. Goldwasser
170
Voted
NIPS
1998
15 years 7 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller
SC
2003
ACM
15 years 11 months ago
Identifying and Exploiting Spatial Regularity in Data Memory References
The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application, strided memory accesses fo...
Tushar Mohan, Bronis R. de Supinski, Sally A. McKe...
ECCV
2004
Springer
16 years 8 months ago
A Robust Algorithm for Characterizing Anisotropic Local Structures
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
Kazunori Okada, Dorin Comaniciu, Navneet Dalal, Ar...
SODA
1994
ACM
88views Algorithms» more  SODA 1994»
15 years 7 months ago
Optimal Prediction for Prefetching in the Worst Case
Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...
P. Krishnan, Jeffrey Scott Vitter