Sciweavers

11231 search results - page 1649 / 2247
» Digging for Data Structures
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
16 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
ISVC
2007
Springer
16 years 1 months ago
Interactive Glyph Placement for Tensor Fields
Visualization of glyphs has a long history in medical imaging but gains much more power when the glyphs are properly placed to fill the screen. Glyph packing is often performed vi...
Mario Hlawitschka, Gerik Scheuermann, Bernd Hamann
SSD
2007
Springer
150views Database» more  SSD 2007»
16 years 1 months ago
Online Amnesic Summarization of Streaming Locations
Abstract. Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time respons...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
VLDB
2007
ACM
121views Database» more  VLDB 2007»
16 years 1 months ago
CellSort: High Performance Sorting on the Cell Processor
In this paper we describe the design and implementation of CellSort − a high performance distributed sort algorithm for the Cell processor. We design CellSort as a distributed b...
Bugra Gedik, Rajesh Bordawekar, Philip S. Yu
CODES
2006
IEEE
16 years 1 months ago
The pipeline decomposition tree: : an analysis tool for multiprocessor implementation of image processing applications
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
Dong-Ik Ko, Shuvra S. Bhattacharyya
« Prev « First page 1649 / 2247 Last » Next »