361 search results - page 16 / 73 » Algorithms for Extracting Timeliness Graphs |
ICDAR
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
IWMMDBMS
1996
13 years 10 months ago
1996
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constr...
JMLR
2011
13 years 3 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
SADM
2008
13 years 8 months ago
2008
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...