686 search results - page 30 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
124
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
In this work we present Discriminative Random Fields (DRFs), a discriminative framework for the classification of image regions by incorporating neighborhood interactions in the l...
137
click to vote
COMPGEOM
1994
ACM
15 years 7 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
119
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
144
click to vote
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
145
Voted
JCO
2010
15 years 1 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...