2981 search results - page 234 / 597 » Word Sense and Subjectivity |
211
click to vote
SIGIR
2003
ACM
15 years 12 months ago
2003
ACM
Stemming can improve retrieval accuracy, but stemmers are language-specific. Character n-gram tokenization achieves many of the benefits of stemming in a language independent way,...
169
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
152
click to vote
CEAS
2006
Springer
15 years 10 months ago
2006
Springer
We address the problem of suggesting who to add as an additional recipient (i.e. cc, or carbon copy) for an email under composition. We address the problem using graphical models ...
179
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
175
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...