Sciweavers

1214 search results - page 31 / 243
» Labeling Points with Weights
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
15 years 5 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ICDAR
2009
IEEE
15 years 3 months ago
Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
Florent Montreuil, Emmanuele Grosicki, Laurent Heu...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 10 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
15 years 7 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
ICCV
2009
IEEE
16 years 11 months ago
Shape-based Recognition of 3D Point Clouds in Urban Environments
This paper investigates the design of a system for recognizing objects in 3D point clouds of urban environments. The system is decomposed into four steps: locating, segmenting, ...
Aleksey Golovinskiy, Vladimir G. Kim, Thomas Funkh...