2496 search results - page 123 / 500 » On covering by translates of a set |
167
click to vote
COLING
1996
15 years 7 months ago
1996
This paper proposes a method to resolve the reference of deictic Japanese zero pronouns which can be implemented in a practical machine translation system. This method focuses on ...
199
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
180
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
147
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
150
click to vote
WSC
2008
15 years 8 months ago
2008
In this study we propose a new method for designing computer experiments inspired by the split plot designs used in physical experimentation. The basic layout is that each set of ...