5115 search results - page 160 / 1023 » On Randomized Lanczos Algorithms |
165
click to vote
ASPLOS
2010
ACM
16 years 1 months ago
2010
ACM
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
188
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
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...
166
click to vote
ISAAC
2004
Springer
16 years 5 days ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
199
click to vote
HASE
2008
IEEE
15 years 7 months ago
2008
IEEE
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...
213
click to vote
FOCM
2008
15 years 6 months ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...