Sciweavers

2127 search results - page 176 / 426
» Computing large matchings fast
Sort
View
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
15 years 10 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
DBSEC
2008
136views Database» more  DBSEC 2008»
15 years 5 months ago
An Opinion Model for Evaluating Malicious Activities in Pervasive Computing Systems
Pervasive computing applications typically involve cooperation among a number of entities spanning multiple organizations. Any security breach in any single entity can have very fa...
Indrajit Ray, Nayot Poolsappasit, Rinku Dewri
PODC
2009
ACM
16 years 4 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
ECCV
2006
Springer
16 years 6 months ago
Integrating Surface Normal Vectors Using Fast Marching Method
i Integration of surface normal vectors is a vital component in many shape reconstruction algorithms that require integrating surface normals to produce their final outputs, the de...
Jeffrey Ho, Jongwoo Lim, Ming-Hsuan Yang, David J....
CCGRID
2001
IEEE
15 years 8 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin