1027 search results - page 38 / 206 » Ordered Vertex Partitioning |
ICDAR
1999
IEEE
14 years 1 months ago
1999
IEEE
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
AUTOMATICA
2010
13 years 8 months ago
2010
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
ICPP
1995
IEEE
14 years 1 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
DAM
1999
13 years 9 months ago
1999
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
JCT
2006
13 years 9 months ago
2006
A k-majority tournament T on a finite vertex set V is defined by a set of 2k - 1 linear orderings of V, with u v if and only if u lies above v in at least k of the orders. Motiva...