Sciweavers

1861 search results - page 152 / 373
» 1.6-Bit Pattern Databases
Sort
View
PODS
2003
ACM
151views Database» more  PODS 2003»
16 years 4 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
174
Voted
AIPR
2004
IEEE
15 years 8 months ago
An Image Retrieval System Using Multispectral Random Field Models, Color, and Geometric Features
This paper describes a novel color texture-based image retrieval system for the query of an image database to find similar images to a target image. The retrieval process involves...
Orlando J. Hernandez, Alireza Khotanzad
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 6 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
16 years 6 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 5 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar