Sciweavers

207 search results - page 4 / 42
» Data Structures for Storing Small Sets in the Bitprobe Model
Sort
View
ICDE
2006
IEEE
130views Database» more  ICDE 2006»
14 years 8 months ago
Warehousing and Analyzing Massive RFID Data Sets
Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. In the near future, it is expected tha...
Hector Gonzalez, Jiawei Han, Xiaolei Li, Diego Kla...
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 8 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
CAISE
2003
Springer
14 years 19 days ago
A Methodology for the Conceptual Modeling of ETL Processes
Extraction-Transformation-Loading (ETL) tools are pieces of software responsible for the extraction of data from several sources, their cleansing, customization and insertion into ...
Alkis Simitsis, Panos Vassiliadis
SMC
2007
IEEE
14 years 1 months ago
ADtrees for sequential data and n-gram Counting
Abstract— We consider the problem of efficiently storing ngram counts for large n over very large corpora. In such cases, the efficient storage of sufficient statistics can ha...
Robert Van Dam, Dan Ventura
AFRIGRAPH
2010
ACM
13 years 11 months ago
Visualization of solution sets from automated docking of molecular structures
Aligning structures, often referred to as docking or registration, is frequently required in fields such as computer science, robotics and structural biology. The task of alignin...
Johannes Jansen van Vuuren, Michelle Kuttel, James...