Sciweavers

492 search results - page 8 / 99
» Fast data stream algorithms using associative memories
Sort
View
SEMWEB
2005
Springer
14 years 1 months ago
BRAHMS: A WorkBench RDF Store and High Performance Memory System for Semantic Association Discovery
Discovery of semantic associations in Semantic Web ontologies is an important task in various analytical activities. Several query languages and storage systems have been designed ...
Maciej Janik, Krys Kochut
CIKM
2009
Springer
14 years 2 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 8 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ISCI
2000
80views more  ISCI 2000»
13 years 7 months ago
Quantum associative memory with distributed queries
This paper discusses a model of quantum associative memory which generalizes the completing associative memory proposed by Ventura and Martinez. Similar to this model, our system ...
A. A. Ezhov, A. V. Nifanova, Dan Ventura
ICDM
2006
IEEE
227views Data Mining» more  ICDM 2006»
14 years 1 months ago
Incremental Mining of Sequential Patterns over a Stream Sliding Window
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...
Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Le...