Sciweavers

549 search results - page 17 / 110
» The corner arc algorithm
Sort
View
GREC
2009
Springer
13 years 5 months ago
Robust and Precise Circular Arc Detection
In this paper we present a method to robustly detect circular arcs in a line drawing image. The method is fast, robust and very reliable, and is capable of assessing the quality of...
Bart Lamiroy, Yassine Guebbas
ACL
1998
13 years 8 months ago
Transforming Lattices into Non-deterministic Automata with Optional Null Arcs
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...
Mark Seligman, Christian Boitet, Boubaker Meddeb-H...
IJAR
2007
130views more  IJAR 2007»
13 years 7 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
13 years 11 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar