Sciweavers

9871 search results - page 225 / 1975
» On the Structure of Low Sets
Sort
View
PVLDB
2008
182views more  PVLDB 2008»
15 years 6 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
CASES
2010
ACM
15 years 4 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
15 years 11 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
VISUALIZATION
2002
IEEE
15 years 11 months ago
Level-Set Segmentation From Multiple Non-Uniform Volume Datasets
Typically 3-D MR and CT scans have a relatively high resolution in the scanning X;Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an obje...
Ken Museth, David E. Breen, Leonid Zhukov, Ross T....
CIKM
2006
Springer
15 years 10 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li