Sciweavers

976 search results - page 152 / 196
» Evaluating Adversarial Partitions
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 2 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
EUROPAR
2005
Springer
14 years 2 months ago
Non-uniform Instruction Scheduling
Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant ...
Joseph J. Sharkey, Dmitry V. Ponomarev
NOSSDAV
2005
Springer
14 years 2 months ago
Supporting P2P gaming when players have heterogeneous resources
We present Ghost, a peer-to-peer game architecture that manages game consistency across a set of players with heterogeneous network resources. Ghost dynamically creates responsive...
Aaron St. John, Brian Neil Levine
SOFSEM
2005
Springer
14 years 2 months ago
RAQ: A Range-Queriable Distributed Data Structure
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
Hamid Nazerzadeh, Mohammad Ghodsi
CC
2004
Springer
14 years 2 months ago
Region-Based Partial Dead Code Elimination on Predicated Code
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...
Qiong Cai, Lin Gao 0002, Jingling Xue