Sciweavers

4516 search results - page 663 / 904
» Data Structures in the Design of Interfaces
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 9 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
152
Voted
IJCAI
1993
15 years 6 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
TC
2011
14 years 12 months ago
Maximizing Spare Utilization by Virtually Reorganizing Faulty Cache Lines
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...
Amin Ansari, Shantanu Gupta, Shuguang Feng, Scott ...
MM
2005
ACM
169views Multimedia» more  MM 2005»
15 years 10 months ago
An ambient intelligence platform for physical play
This paper describes an ambient intelligent prototype known as socio-ec(h)o. socio-ec(h)o explores the design and implementation of a system for sensing and display, user modeling...
Ron Wakkary, Marek Hatala, Robb Lovell, Milena Dro...
146
Voted
ISLPED
2003
ACM
115views Hardware» more  ISLPED 2003»
15 years 10 months ago
Reducing energy and delay using efficient victim caches
In this paper, we investigate methods for improving the hit rates in the first level of memory hierarchy. Particularly, we propose victim cache structures to reduce the number of ...
Gokhan Memik, Glenn Reinman, William H. Mangione-S...