4095 search results - page 337 / 819 » How to test a tree |
186
click to vote
GI
1997
Springer
15 years 9 months ago
1997
Springer
This paper gives an overview of an architecture and search organization for large vocabulary, continuous speech recognition (LVCSR at RWTH). In the rst part of the paper, we descri...
146
click to vote
COMPGEOM
1990
ACM
15 years 9 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
284
click to vote
CICLING
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The need of the current Natural Language Processing applications to identify text segments that express the same meaning in different ways, evolved into the identificatio...
145
click to vote
AIMSA
2006
Springer
15 years 9 months ago
2006
Springer
Effective automatic summarization usually requires simulating asoning such as abstraction or relevance reasoning. In this paper we describe a solution for this type of reasoning in...
191
Voted
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...