Sciweavers

263 search results - page 47 / 53
» On the Containment of Forbidden Patterns Problems
Sort
View
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 2 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
EDBT
2012
ACM
247views Database» more  EDBT 2012»
12 years 12 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
KDD
2002
ACM
145views Data Mining» more  KDD 2002»
15 years 10 months ago
Handling very large numbers of association rules in the analysis of microarray data
The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years, and different data mining techniques have been proposed for ...
Alexander Tuzhilin, Gediminas Adomavicius
CIARP
2009
Springer
15 years 4 months ago
3D and Appearance Modeling from Images
This paper gives an overview of works done in our group on 3D and appearance modeling of objects, from images. The backbone of our approach is to use what we consider as the princi...
Peter F. Sturm, Amaël Delaunoy, Pau Gargallo,...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
14 years 10 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar