11565 search results - page 113 / 2313 » Computing Minimal Mappings |
125
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
124
Voted
CIE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...
ACL
2010
15 years 2 months ago
2010
In this paper, we formulate extractive summarization as a risk minimization problem and propose a unified probabilistic framework that naturally combines supervised and unsupervis...
148
click to vote
ECCV
2000
Springer
16 years 5 months ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
109
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app...