1871 search results - page 269 / 375 » The Ephemeral Pairing Problem |
166
click to vote
SIGIR
2005
ACM
16 years 1 days ago
2005
ACM
This paper describes a method of detecting Japanese Katakana variants from a large corpus. Katakana words, which are mainly used as loanwords, cause problems with information retr...
151
click to vote
ACISP
2005
Springer
16 years 1 days ago
2005
Springer
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
183
click to vote
CICLING
2005
Springer
16 years 16 hour ago
2005
Springer
The problem of the resolution of the lexical ambiguity, which is commonly referred as Word Sense Disambiguation (WSD), seems to be stuck because of the knowledge acquisition bottle...
163
click to vote
EVOW
2005
Springer
16 years 7 hour ago
2005
Springer
This work presents an evolutionary approach to improve the infection algorithm to solve the problem of dense stereo matching. Dense stereo matching is used for 3D reconstruction in...
193
click to vote
IBPRIA
2005
Springer
16 years 1 hour ago
2005
Springer
Sign language recognition constitutes a challenging field of research in computer vision. Common problems like overlap, ambiguities, and minimal pairs occur frequently and require...