Sciweavers

15792 search results - page 284 / 3159
» Computational Abstraction Steps
Sort
View
WWW
2005
ACM
16 years 8 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
ICCAD
2005
IEEE
110views Hardware» more  ICCAD 2005»
16 years 4 months ago
Computational geometry based placement migration
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
Tao Luo, Haoxing Ren, Charles J. Alpert, David Zhi...
IROS
2008
IEEE
131views Robotics» more  IROS 2008»
16 years 1 months ago
Deformations of general parametric shells: Computation and robot experiment
— A shell is a body enclosed between two closely spaced and curved surfaces. Classical theory of shells [38], [33], [16] assumes a parametrization along the lines of principal cu...
Yan-Bin Jia, Jiang Tian
MUE
2008
IEEE
173views Multimedia» more  MUE 2008»
16 years 1 months ago
Efficient Data Dissemination in Mobile P2P Ad-Hoc Networks for Ubiquitous Computing
In this paper we propose Rank-Based Broadcast (RBB) algorithm using High Order Markov Chain (HOMC) with weight values in mobile p2p ad-hoc networks (MOPNET) for ubiquitous. RBB us...
Do-Hoon Kim, Myoung Rak Lee, Longzhe Han, Hoh Pete...
ICTAI
2006
IEEE
16 years 1 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...