Sciweavers

5115 search results - page 418 / 1023
» On Randomized Lanczos Algorithms
Sort
View
FOCS
2007
IEEE
16 years 1 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
WWW
2005
ACM
16 years 8 months ago
BackRank: an alternative for PageRank?
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algor...
Mohamed Bouklit, Fabien Mathieu
ICCAD
2008
IEEE
129views Hardware» more  ICCAD 2008»
16 years 4 months ago
A capacitance solver for incremental variation-aware extraction
Abstract—Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from ...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
QEST
2009
IEEE
16 years 2 months ago
On the Impact of Modelling Choices for Distributed Information Spread
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
Rena Bakhshi, Ansgar Fehnker
IAT
2006
IEEE
16 years 1 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler