Sciweavers

1127 search results - page 155 / 226
» Value Compression for Efficient Computation
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
15 years 10 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
RTCSA
2007
IEEE
15 years 4 months ago
A Continuous Query Index for Processing Queries on RFID Data Stream
RFID middleware systems collect and filter RFID streaming data gathered continuously by numerous readers to process requests from applications. These requests are called continuou...
Jaekwan Park, Bonghee Hong, ChaeHoon Ban
SMA
1999
ACM
100views Solid Modeling» more  SMA 1999»
15 years 2 months ago
Matchmaker: manifold BReps for non-manifold r-sets
Many solid modeling construction techniques produce non-manifold r-sets (solids). With each non-manifold model N we can associate a family of manifold solid models that are infini...
Jarek Rossignac, David E. Cardoze
CGF
2008
150views more  CGF 2008»
14 years 10 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
SIGMOD
2002
ACM
129views Database» more  SIGMOD 2002»
15 years 10 months ago
Dwarf: shrinking the PetaCube
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
Yannis Sismanis, Antonios Deligiannakis, Nick Rous...