1850 search results - page 325 / 370 » classification 2010 |
141
click to vote
COLING
2010
14 years 11 months ago
2010
Near-synonyms are useful knowledge resources for many natural language applications such as query expansion for information retrieval (IR) and paraphrasing for text generation. Ho...
127
click to vote
COLING
2010
14 years 11 months ago
2010
Prepositions in English are a well-known challenge for language learners, and the computational analysis of preposition usage has attracted significant attention. Such research ge...
132
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
152
Voted
ML
2010
ACM
14 years 10 months ago
2010
ACM
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
146
click to vote
ML
2010
ACM
14 years 10 months ago
2010
ACM
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...