Sciweavers

103 search results - page 17 / 21
» An Efficient Sparse Regularity Concept
Sort
View
ASPLOS
2010
ACM
14 years 8 months ago
Best-effort semantic document search on GPUs
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
Surendra Byna, Jiayuan Meng, Anand Raghunathan, Sr...
VISUALIZATION
1999
IEEE
15 years 1 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
GRID
2006
Springer
14 years 9 months ago
Snapshot Processing in Streaming Environments
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...
Daniel M. Zimmerman, K. Mani Chandy
115
Voted
SDM
2004
SIAM
253views Data Mining» more  SDM 2004»
14 years 11 months ago
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
Peer Kröger, Hans-Peter Kriegel, Karin Kailin...
PAMI
1998
87views more  PAMI 1998»
14 years 9 months ago
Learning Local Languages and Their Application to DNA Sequence Analysis
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...
Takashi Yokomori, Satoshi Kobayashi