Sciweavers

441 search results - page 34 / 89
» Convex Graph Invariants
Sort
View
ICDAR
2009
IEEE
14 years 2 months ago
Multi-Oriented and Multi-Sized Touching Character Segmentation Using Dynamic Programming
In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate...
Partha Pratim Roy, Umapada Pal, Josep Lladó...
HAPTICS
2005
IEEE
14 years 1 months ago
A Closest Point Algorithm for Parametric Surfaces with Global Uniform Asymptotic Stability
— We present an algorithm that determines the point on a convex parametric surface patch that is closest to a given (possibly moving) point. Any initial point belonging to the su...
Volkan Patoglu, R. Brent Gillespie
FASE
2005
Springer
14 years 1 months ago
Ensuring Structural Constraints in Graph-Based Models with Type Inheritance
Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entitie...
Gabriele Taentzer, Arend Rensink
DIS
2007
Springer
13 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
DAM
1998
85views more  DAM 1998»
13 years 7 months ago
Separability Generalizes Dirac's Theorem
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
Anne Berry, Jean Paul Bordat