Sciweavers

5962 search results - page 3 / 1193
» Efficient Clustering for Orders
Sort
View
CSCLP
2006
Springer
13 years 9 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
DEXA
2009
Springer
172views Database» more  DEXA 2009»
13 years 9 months ago
Utilizing XML Clustering for Efficient XML Data Management on P2P Networks
Peer-to-Peer (P2P) data integration combines the P2P infrastructure with traditional scheme-based data integration techniques. Some of the primary problems in this research area ar...
Panagiotis Antonellis, Christos Makris, Nikos Tsir...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
13 years 6 months ago
Call to order: a hierarchical browsing approach to eliciting users' preference
Computing preference queries has received a lot of attention in the database community. It is common that the user is unsure of his/her preference, so care must be taken to elicit...
Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H....
RECOMB
2008
Springer
14 years 6 months ago
Computation of Median Gene Clusters
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
Sebastian Böcker, Katharina Jahn, Julia Mixta...
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
13 years 10 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny