Sciweavers

2498 search results - page 11 / 500
» Data Structures with Unpredictable Timing
Sort
View
61
Voted
DCC
2006
IEEE
15 years 9 months ago
Compressed Data Structures: Dictionaries and Data-Aware Measures
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Sco...
PVM
1997
Springer
15 years 1 months ago
Message Handling in Parallel Radiance
Photo-realistic computergraphics is an area of research which tries to develop algorithms and methods to render images of arti cial models or worlds as realistically as possible, b...
Erik Reinhard, Alan Chalmers
SIGMOD
2009
ACM
172views Database» more  SIGMOD 2009»
15 years 4 months ago
Self-organizing tuple reconstruction in column-stores
Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only th...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
DEBU
2000
147views more  DEBU 2000»
14 years 9 months ago
XJoin: A Reactively-Scheduled Pipelined Join Operator
Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imb...
Tolga Urhan, Michael J. Franklin
VLSID
2005
IEEE
131views VLSI» more  VLSID 2005»
15 years 10 months ago
Efficient Space/Time Compression to Reduce Test Data Volume and Testing Time for IP Cores
Abstract-- We present two-dimensional (space/time) compression techniques that reduce test data volume and test application time for scan testing of intellectual property (IP) core...
Lei Li, Krishnendu Chakrabarty, Seiji Kajihara, Sh...