3641 search results - page 445 / 729 » On Computability of Pattern Recognition Problems |
132
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we consider the recognition problem on the HHDS-free graphs, a class of homogeneously orderable graphs, and we show that it has polynomial time complexity. In partic...
175
click to vote
NAACL
2010
15 years 2 months ago
2010
We address the problem of formatting the output of an automatic speech recognition (ASR) system for readability, while preserving wordlevel timing information of the transcript. O...
149
click to vote
TC
2010
14 years 11 months ago
2010
Continued logarithms, as originally introduced by Gosper, represent a means for exact rational arithmetic, but their application to exact real arithmetic is limited by the uniquene...
115
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
124
Voted
CAD
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...