107 search results - page 22 / 22 » Approximation algorithms for art gallery problems in polygon... |
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
SIGIR
1997
ACM
13 years 9 months ago
1997
ACM
Word usage is domain dependent. A common word in one domain can be quite infrequent in another. In this study we exploit this property of word usage to improve document routing. W...