Sciweavers

186 search results - page 37 / 38
» Fast Computation of Sparse Datacubes
Sort
View
VLDB
2004
ACM
100views Database» more  VLDB 2004»
14 years 3 months ago
Resilient Rights Protection for Sensor Streams
Today’s world of increasingly dynamic computing environments naturally results in more and more data being available as fast streams. Applications such as stock market analysis,...
Radu Sion, Mikhail J. Atallah, Sunil Prabhakar
VISUALIZATION
1999
IEEE
14 years 2 months ago
Splatting Without the Blur
Splatting is a volume rendering algorithm that combines efficient volume projection with a sparse data representation: Only voxels that have values inside the iso-range need to be...
Klaus Mueller, Torsten Möller, Roger Crawfis
DAS
2010
Springer
14 years 1 months ago
Handwritten Arabic text line segmentation using affinity propagation
In this paper, we present a novel graph-based method for extracting handwritten text lines in monochromatic Arabic document images. Our approach consists of two steps Coarse text ...
Jayant Kumar, Wael Abd-Almageed, Le Kang, David S....
CGF
2008
121views more  CGF 2008»
13 years 10 months ago
Tensor Clustering for Rendering Many-Light Animations
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
Milos Hasan, Edgar Velázquez-Armendá...
AI
2002
Springer
13 years 9 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm