Sciweavers

977 search results - page 153 / 196
» Permuting Web Graphs
Sort
View
CSUR
1999
159views more  CSUR 1999»
15 years 1 months ago
Hubs, authorities, and communities
The Web can be naturally modeled as a directed graph, consisting of a set of abstract nodes (the pages) joined by directional edges (the hyperlinks). Hyperlinks encode a considerab...
Jon M. Kleinberg
ICCV
2007
IEEE
16 years 3 months ago
Learning Structured Appearance Models from Captioned Images of Cluttered Scenes
Given an unstructured collection of captioned images of cluttered scenes featuring a variety of objects, our goal is to learn both the names and appearances of the objects. Only a...
Michael Jamieson, Afsaneh Fazly, Sven J. Dickinson...
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