Sciweavers

1369 search results - page 63 / 274
» Lattice computations for random numbers
Sort
View
COMPSAC
2008
IEEE
15 years 8 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
CDC
2009
IEEE
285views Control Systems» more  CDC 2009»
14 years 11 months ago
Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
Alexander V. Nazin, Boris T. Polyak
FOCS
1992
IEEE
15 years 5 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 7 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
ICPR
2010
IEEE
15 years 5 months ago
Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition
We present a fast and robust graph matching approach for 2D specific object recognition in images. From a small number of training images, a model graph of the object to learn is a...
Jerome Revaud, Guillaume Lavoue, Yasuo Ariki, Atil...