Sciweavers

1109 search results - page 182 / 222
» Crawling on web graphs
Sort
View
ICDE
2004
IEEE
115views Database» more  ICDE 2004»
16 years 3 months ago
Unordered Tree Mining with Applications to Phylogeny
Frequent structure mining (FSM) aims to discover and extract patterns frequently occurring in structural data, such as trees and graphs. FSM finds many applications in bioinformat...
Dennis Shasha, Jason Tsong-Li Wang, Sen Zhang
WWW
2005
ACM
16 years 2 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
ICPP
2009
IEEE
15 years 8 months ago
Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
Karl Jiang, David Ediger, David A. Bader
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 8 months ago
Rendezvous without coordinates
— We study minimalism in sensing and control by considering a multi-agent system in which each agent moves like a Dubins car and has a limited sensor that reports only the presen...
Jingjin Yu, Steven M. LaValle, Daniel Liberzon
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
15 years 8 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han