Sciweavers

417 search results - page 32 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
JVCIR
2006
126views more  JVCIR 2006»
14 years 9 months ago
Efficient intra- and inter-mode selection algorithms for H.264/ AVC
Intra-frame mode selection and inter-frame mode selection are new features introduced in the H.264 standard. Intra-frame mode selection dramatically reduces spatial redundancy in ...
Andy C. Yu, King Ngi Ngan, Graham R. Martin
71
Voted
WSC
2007
15 years 9 hour ago
Applying parallel and distributed simulation to remote network emulation
Many of today’s military services and applications run on geographically distributed sites and need to be tested and evaluated under realistic scenarios with many unpredictable ...
Yan Gu, Richard Fujimoto
88
Voted
CGF
1999
86views more  CGF 1999»
14 years 9 months ago
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
Jihad El-Sana, Amitabh Varshney
VLDB
1999
ACM
145views Database» more  VLDB 1999»
15 years 1 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...