3946 search results - page 55 / 790 » The computational complexity of choice sets |
107
click to vote
CONCUR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a compositional trace-based model for probabilistic systems. The behavior of a system with probabilistic choice is a stochasticprocess, namely, a probability d...
CCCG
2008
15 years 1 months ago
2008
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
PAMI
2008
14 years 11 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
121
click to vote
ARC
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper we present a framework for the automatic identification and selection of convex MIMO instruction-set extensions for reconfigurable architecture. The framewo...
364
click to vote
Publication
We develop a fast method to localize the level set method of Osher and Sethian (1988, Journal of Computational Physics) and address two important issues that are intrinsic to the l...