Sciweavers

2004 search results - page 27 / 401
» Sampling from large graphs
Sort
View
CIKM
2008
Springer
15 years 1 months ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
DEDS
2002
106views more  DEDS 2002»
14 years 11 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper
CORR
2002
Springer
175views Education» more  CORR 2002»
14 years 11 months ago
Creating Annotation Tools with the Annotation Graph Toolkit
The Annotation Graph Toolkit is a collection of software supporting the development of annotation tools based on the annotation graph model. The toolkit includes application progr...
Kazuaki Maeda, Steven Bird, Xiaoyi Ma, Haejoong Le...
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 1 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
ACSC
2005
IEEE
15 years 5 months ago
Large k-Separated Matchings of Random Regular Graphs
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
Mihalis Beis, William Duckworth, Michele Zito