Sciweavers

1684 search results - page 148 / 337
» The lexicographic decision function
Sort
View
FOCS
1998
IEEE
15 years 8 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 4 months ago
Measure and integral with purely ordinal scales
We develop a purely ordinal model for aggregation functionals for lattice valued functions, comprising as special cases quantiles, the Ky Fan metric and the Sugeno integral. For m...
Dieter Denneberg, Michel Grabisch
AMC
2006
114views more  AMC 2006»
15 years 4 months ago
A multi-objective resource allocation problem in dynamic PERT networks
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
Amir Azaron, Reza Tavakkoli-Moghaddam
INTERSPEECH
2010
14 years 10 months ago
Improvements of search error risk minimization in viterbi beam search for speech recognition
This paper describes improvements in a search error risk minimization approach to fast beam search for speech recognition. In our previous work, we proposed this approach to reduc...
Takaaki Hori, Shinji Watanabe, Atsushi Nakamura
CVPR
2005
IEEE
16 years 6 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas