Sciweavers

1709 search results - page 101 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
ICDE
2005
IEEE
132views Database» more  ICDE 2005»
15 years 10 months ago
CLICKS: Mining Subspace Clusters in Categorical Data via K-partite Maximal Cliques
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
Mohammed Javeed Zaki, Markus Peters
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
15 years 8 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
DOLAP
2010
ACM
15 years 3 months ago
Relational versus non-relational database systems for data warehousing
Relational database systems have been the dominating technology to manage and analyze large data warehouses. Moreover, the ER model, the standard in database design, has a close r...
Carlos Ordonez, Il-Yeol Song, Carlos Garcia-Alvara...
159
Voted
CIKM
2005
Springer
15 years 10 months ago
Detecting changes on unordered XML documents using relational databases: a schema-conscious approach
Several relational approaches have been proposed to detect the changes to XML documents by using relational databases. These approaches store the XML documents in the relational d...
Erwin Leonardi, Sourav S. Bhowmick
MM
2004
ACM
99views Multimedia» more  MM 2004»
15 years 10 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...