1356 search results - page 85 / 272 » Some New Results on Inverse Sorting Problems |
ANLP
2000
13 years 10 months ago
2000
This paper explores the problem of identifying sentence boundaries in the transcriptions produced by automatic speech recognition systems. An experiment which determines the level...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...
ECCC
2006
13 years 9 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
JSAC
2008
13 years 9 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
CP
2009
Springer
14 years 9 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...