Sciweavers

197 search results - page 5 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
CORR
2012
Springer
250views Education» more  CORR 2012»
12 years 3 months ago
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
Arlei Silva, Wagner Meira Jr., Mohammed J. Zaki
PVLDB
2010
149views more  PVLDB 2010»
13 years 5 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
14 years 1 months ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
14 years 7 months ago
Containment Join Size Estimation: Models and Methods
Recent years witnessed an increasing interest in researches in XML, partly due to the fact that XML has now become the de facto standard for data interchange over the internet. A ...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 7 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam