Sciweavers

1007 search results - page 118 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
131
Voted
DEBU
2010
128views more  DEBU 2010»
15 years 4 hour ago
Designing Database Operators for Flash-enabled Memory Hierarchies
Flash memory affects not only storage options but also query processing. In this paper, we analyze the use of flash memory for database query processing, including algorithms that...
Goetz Graefe, Stavros Harizopoulos, Harumi A. Kuno...
116
Voted
UIST
2005
ACM
15 years 8 months ago
Preference elicitation for interface optimization
Decision-theoretic optimization is becoming a popular tool in the user interface community, but creating accurate cost (or utility) functions has become a bottleneck — in most c...
Krzysztof Gajos, Daniel S. Weld
VISUALIZATION
2005
IEEE
15 years 8 months ago
A Shader-Based Parallel Rendering Framework
Existing parallel or remote rendering solutions rely on communicating pixels, OpenGL commands, scene-graph changes or application-specific data. We propose an intermediate soluti...
Jérémie Allard, Bruno Raffin
123
Voted
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
15 years 9 months ago
Transition-activity aware design of reduction-stages for parallel multipliers
We propose an interconnect reorganization algorithm for reduction stages in parallel multipliers. It aims at minimizing power consumption for given static probabilities at the pri...
Saeeid Tahmasbi Oskuii, Per Gunnar Kjeldsberg, Osc...
125
Voted
VLDB
1993
ACM
152views Database» more  VLDB 1993»
15 years 6 months ago
Declustering Objects for Visualization
In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on ...
Ling Tony Chen, Doron Rotem