Sciweavers

3907 search results - page 294 / 782
» Time, Knowledge, and Choice
Sort
View
TPDS
2002
80views more  TPDS 2002»
15 years 6 months ago
Performance Optimization Problem in Speculative Prefetching
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
CHI
2009
ACM
16 years 7 months ago
Using temporal patterns (t-patterns) to derive stress factors of routine tasks
We describe the use of a statistical technique called Tpattern analysis to derive and characterize the routineness of tasks. T-patterns provide significant advantages over traditi...
Oliver Brdiczka, Norman Makoto Su, Bo Begole
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
16 years 1 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
ICC
2007
IEEE
16 years 1 months ago
TOA Estimation with Pulses of Unknown Shape
—This paper investigates time of arrival estimation via impulse radio ultra-wideband technology. A dense multipath channel is assumed and frequency-selective propagation effects ...
Antonio A. D'Amico, Umberto Mengali, Lorenzo Tapon...
ICALP
2007
Springer
16 years 27 days ago
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...
Michael Elkin