Sciweavers

1857 search results - page 40 / 372
» Minimum Degree Orderings
Sort
View
DGCI
2009
Springer
14 years 2 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...
Xavier Provençal, Jacques-Olivier Lachaud
CCA
2009
Springer
14 years 5 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
EJC
2008
13 years 10 months ago
Identifying codes of cycles with odd orders
The problem of the r-identifying code of a cycle Cn has been solved totally when n is even. Recently, S. Gravier et al. give the r-identifying code for the cycle Cn with the minim...
Min Xu, Krishnaiyan Thulasiraman, Xiao-Dong Hu
SYNTHESE
2010
99views more  SYNTHESE 2010»
13 years 9 months ago
Vagueness, uncertainty and degrees of clarity
The focus of the paper is on the logic of clarity and the problem of higherorder vagueness. We first examine the consequences of the notion of intransitivity of indiscriminabilit...
Paul Égré, Denis Bonnay
TCBB
2010
106views more  TCBB 2010»
13 years 5 months ago
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Christophe Godin, Pascal Ferraro