Sciweavers

203 search results - page 9 / 41
» Random walks on graphs to model saliency in images
Sort
View
111
Voted
AOSD
2007
ACM
15 years 4 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
152
Voted
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
15 years 8 days ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
139
Voted
ICIP
2009
IEEE
15 years 10 months ago
Edge-preserving Colorization using Data-Driven Random Walks with Restart
In this paper, we consider the colorization problem of grayscale images in which some color scribbles are initially given. Our proposed method is based on the weighted color blendi...
Tae Hoon Kim (Seoul National University), Kyoung M...
JCT
2007
108views more  JCT 2007»
15 years 7 days ago
The cover time of the preferential attachment graph
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
Colin Cooper, Alan M. Frieze
102
Voted
ICTAI
2006
IEEE
15 years 6 months ago
Outlier Detection Using Random Walks
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
H. D. K. Moonesinghe, Pang-Ning Tan