709 search results - page 7 / 142 » In-stroke word completion |
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
104
click to vote
EMNLP
2009
14 years 9 months ago
2009
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
ACL
1997
15 years 1 months ago
1997
This paper presents a method to combine a set of unsupervised algorithms that can accurately disambiguate word senses in a large, completely untagged corpus. Although most of the ...
PCM
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents a novel gradient-based image completion algorithm for removing significant objects from natural images or photographs. Our method reconstructs the region of r...
117
click to vote
COCO
1991
Springer
15 years 3 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...