402 search results - page 60 / 81 » On Finding the Number of Graph Automorphisms |
SODA
1998
ACM
13 years 9 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
KAIS
2008
13 years 7 months ago
2008
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
We demonstrate a flight meta-search engine that is based on the Metamorph framework. Metamorph provides mechanisms to model web forms together with the interactions which are need...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...