4451 search results - page 11 / 891 » On Random Ordering Constraints |
289
click to vote
CVPR
2011
IEEE
15 years 5 days ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
129
click to vote
ASPLOS
2010
ACM
15 years 11 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...
157
click to vote
SIAMJO
2010
14 years 10 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
130
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
117
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...