Sciweavers

387 search results - page 37 / 78
» Many Random Walks Are Faster Than One
Sort
View
ASPDAC
2001
ACM
75views Hardware» more  ASPDAC 2001»
14 years 22 days ago
Correlation method of circuit-performance and technology fluctuations for improved design reliability
Abstract-- We propose a method of correlating circuit performance with technology fluctuations during the circuit-design phase. The method employs test circuits sensitive for techn...
D. Miyawaki, Shizunori Matsumoto, Hans Jürgen...
CEC
2007
IEEE
14 years 3 months ago
A fractal representation for real optimization
— The chaos game, in which a moving point is repeatedly averaged toward randomly selected vertices of a triangle, is one method of generating the fractal called the Sierpinski tr...
Daniel A. Ashlock, Justin Schonfeld
CIKM
2009
Springer
14 years 3 months ago
A general markov framework for page importance computation
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
INFOCOM
2006
IEEE
14 years 3 months ago
RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications
— Many Peer-to-peer (P2P) applications such as media broadcasting and content distribution require a high performance overlay structure in order to deliver satisfying quality of ...
Jin Liang, Klara Nahrstedt
CVPR
2006
IEEE
14 years 3 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov