Sciweavers

5115 search results - page 69 / 1023
» On Randomized Lanczos Algorithms
Sort
View
TIP
2008
124views more  TIP 2008»
14 years 11 months ago
Graph Laplacian Tomography From Unknown Random Projections
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
Ronald R. Coifman, Yoel Shkolnisky, Fred J. Sigwor...
STOC
2007
ACM
92views Algorithms» more  STOC 2007»
16 years 4 days ago
Tight bounds for asynchronous randomized consensus
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
Hagit Attiya, Keren Censor
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 3 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
CRYPTO
2012
Springer
219views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Tamper and Leakage Resilience in the Split-State Model
It is notoriously difficult to create hardware that is immune from side channel and tampering attacks. A lot of recent literature, therefore, has instead considered algorithmic de...
Feng-Hao Liu, Anna Lysyanskaya
IJCNN
2007
IEEE
15 years 6 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin