Sciweavers

286 search results - page 36 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
83
Voted
CSCLP
2006
Springer
15 years 1 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
ICASSP
2010
IEEE
14 years 9 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
Vladimir Magdin, Hui Jiang
CVIU
2006
105views more  CVIU 2006»
14 years 9 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
ICPR
2008
IEEE
15 years 10 months ago
Fast and precise kinematic skeleton extraction of 3D dynamic meshes
Shape skeleton extraction is a fundamental preprocessing task in shape-based pattern recognition. This paper presents a new algorithm for fast and precise extraction of kinematic ...
Jean-Philippe Vandeborre, Julien Tierny, Mohamed D...
67
Voted
STOC
1998
ACM
129views Algorithms» more  STOC 1998»
15 years 1 months ago
Planar Map Graphs
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...