Sciweavers

2035 search results - page 173 / 407
» Working memory
Sort
View
134
Voted
CHI
2005
ACM
15 years 5 months ago
Improving revisitation in fisheye views with visit wear
The distortion caused by an interactive fisheye lens can make it difficult for people to remember items and locations in the data space. In this paper we introduce the idea of vis...
Amy Skopik, Carl Gutwin
209
Voted
CAL
2010
15 years 1 months ago
A Dynamic Pressure-Aware Associative Placement Strategy for Large Scale Chip Multiprocessors
This paper describes dynamic pressure-aware associative placement (DPAP), a novel distributed cache management scheme for large-scale chip multiprocessors. Our work is motivated by...
Mohammad Hammoud, Sangyeun Cho, Rami G. Melhem
CLUSTER
2006
IEEE
15 years 9 months ago
Initial Performance Evaluation of the NetEffect 10 Gigabit iWARP Adapter
Interconnect speeds currently surpass the abilities of today’s processors to satisfy their demands. The throughput rate provided by the network simply generates too much protoco...
Dennis Dalessandro, Pete Wyckoff, Gary Montry
101
Voted
ICCAD
2007
IEEE
116views Hardware» more  ICCAD 2007»
16 years 14 days ago
Device and architecture concurrent optimization for FPGA transient soft error rate
Late CMOS scaling reduces device reliability, and existing work has studied the permanent SER (soft error rate) for configuration memory in FPGA extensively. In this paper, we sh...
Yan Lin, Lei He
118
Voted
ESA
2007
Springer
100views Algorithms» more  ESA 2007»
15 years 9 months ago
Radix Sorting with No Extra Space
It is well known that n integers in the range [1, nc ] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted i...
Gianni Franceschini, S. Muthukrishnan, Mihai Patra...