4591 search results - page 512 / 919 » The Global Computer |
182
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
196
click to vote
NIPS
2008
15 years 8 months ago
2008
Offline handwriting recognition--the transcription of images of handwritten text--is an interesting task, in that it combines computer vision with sequence learning. In most syste...
218
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
With the advent of high throughput technologies, feature selection has become increasingly important in a wide range of scientific disciplines. We propose a new feature selection ...
176
click to vote
STRINGOLOGY
2008
15 years 8 months ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
163
click to vote
FLAIRS
2004
15 years 8 months ago
2004
In this paper we describe I-Subdue, an extension to the Subdue graph-based data mining system. I-Subdue operates over sequentially received relational data to incrementally discov...