1826 search results - page 251 / 366 » Using Random Forests in the Structured Language Model |
188
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
162
click to vote
DATE
2005
IEEE
15 years 12 months ago
2005
IEEE
Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design process. A significant bottleneck in the validatio...
179
click to vote
APIN
2006
15 years 6 months ago
2006
Biologists are building increasingly complex models and simulations of cells and other biological entities, and are looking at alternatives to traditional representations. Making ...
150
click to vote
COLING
2002
15 years 6 months ago
2002
Chinese NE (Named Entity) recognition is a difficult problem because of the uncertainty in word segmentation and flexibility in language structure. This paper proposes the use of ...
184
click to vote
NLDB
2007
Springer
16 years 13 days ago
2007
Springer
Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...