Sciweavers

732 search results - page 141 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
14 years 9 months ago
Declarative Querying for Biological Sequences
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
Sandeep Tata, Jignesh M. Patel, James S. Friedman,...
FPGA
2008
ACM
623views FPGA» more  FPGA 2008»
13 years 9 months ago
From the bitstream to the netlist
We present an in-depth analysis of the Xilinx bitstream format. The information gathered in this paper allows bitstream compilation and decompilation. While not actually compromis...
Jean-Baptiste Note, Éric Rannaud
EDBT
2009
ACM
137views Database» more  EDBT 2009»
13 years 5 months ago
Flexible and scalable storage management for data-intensive stream processing
Data Stream Management Systems (DSMS) operate under strict performance requirements. Key to meeting such requirements is to efficiently handle time-critical tasks such as managing...
Irina Botan, Gustavo Alonso, Peter M. Fischer, Don...
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
13 years 11 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
SAC
2010
ACM
14 years 2 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil