Sciweavers

4850 search results - page 99 / 970
» Approximate Data Structures with Applications
Sort
View
EH
2004
IEEE
74views Hardware» more  EH 2004»
15 years 1 months ago
Sensory Channel Grouping and Structure from Uninterpreted Sensor Data
In this paper we focus on the problem of making a model of the sensory apparatus from raw uninterpreted sensory data as defined by Pierce and Kuipers (Artificial Intelligence 92:1...
Lars Olsson, Chrystopher L. Nehaniv, Daniel Polani
FTTCS
2006
132views more  FTTCS 2006»
14 years 10 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
CIKM
2004
Springer
15 years 3 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
FIMI
2004
175views Data Mining» more  FIMI 2004»
14 years 11 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan
DASFAA
2003
IEEE
142views Database» more  DASFAA 2003»
15 years 3 months ago
GLASS: A Graphical Query Language for Semi-Structured Data
The increase in the use of XML (eXtensible Markup Language) makes the semistructured data more and more important on the Web. To exploit the full power of XML documents, a query l...
Wei Ni, Tok Wang Ling