Sciweavers

5138 search results - page 181 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ACCV
2009
Springer
16 years 1 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
HASE
2008
IEEE
15 years 6 months ago
Randomization Based Probabilistic Approach to Detect Trojan Circuits
In this paper, we propose a randomization based technique to verify whether a manufactured chip conforms to its design or is infected by any trojan circuit. A trojan circuit can be...
Susmit Jha, Sumit Kumar Jha
FOCM
2008
156views more  FOCM 2008»
15 years 6 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
15 years 10 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
15 years 11 months ago
TestFul: using a hybrid evolutionary algorithm for testing stateful systems
This paper introduces TestFul, a framework for testing stateful systems and focuses on object-oriented software. TestFul employs a hybrid multi-objective evolutionary algorithm, t...
Matteo Miraz, Pier Luca Lanzi, Luciano Baresi