Sciweavers

117 search results - page 18 / 24
» Read-optimized databases, in depth
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SSD
2001
Springer
218views Database» more  SSD 2001»
13 years 12 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
3DOR
2008
13 years 8 months ago
A 3D Face Recognition Algorithm Using Histogram-based Features
We present an automatic face recognition approach, which relies on the analysis of the three-dimensional facial surface. The proposed approach consists of two basic steps, namely ...
Xuebing Zhou, Helmut Seibert, Christoph Busch, Wol...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 1 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
ICCV
1998
IEEE
14 years 9 months ago
View-Based Object Matching
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
Ali Shokoufandeh, Ivan Marsic, Sven J. Dickinson