3244 search results - page 281 / 649 » On convex complexity measures |
186
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
183
click to vote
COR
2008
15 years 5 months ago
2008
Quantitative performance modeling of complex information systems is of immense importance for designing enterprise e-business infrastructures and applications. In this paper, we p...
172
click to vote
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
—This paper shows how to reduce evaluation time for context inference. Probabilistic Context Inference has proven to be a good representation of the physical reality with uncerta...
166
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
We develop a similarity measure to detect repeatedly occurring Out-of-Vocabulary words (OOV), since these carry important information. Sub-word sequences in the recognition output...
175
click to vote
IACR
2011
14 years 6 months ago
2011
Generic decoding of linear codes is the best known attack against most code-based cryptosystems. Understanding and measuring the complexity of the best decoding technique is thus n...