Sciweavers

124 search results - page 18 / 25
» The spread of the unicyclic graphs
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Detecting Rotational Symmetries
We present an algorithm for detecting multiple rotational symmetries in natural images. Given an image, its gradient magnitude field is computed, and information from the gradient...
V. Shiv Naga Prasad, Larry S. Davis
WWW
2005
ACM
14 years 8 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
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 8 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
CIBCB
2007
IEEE
14 years 1 months ago
Evolving Extremal Epidemic Networks
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
Dan Ashlock, Fatemeh Jafargholi
NDSS
2005
IEEE
14 years 1 months ago
Enriching Intrusion Alerts Through Multi-Host Causality
Current intrusion detection systems point out suspicious states or events but do not show how the suspicious state or events relate to other states or events in the system. We sho...
Samuel T. King, Zhuoqing Morley Mao, Dominic G. Lu...