Sciweavers

257 search results - page 22 / 52
» The convexity spectra of graphs
Sort
View
SIAMCO
2000
74views more  SIAMCO 2000»
13 years 7 months ago
Nonsmooth Duality, Sandwich, and Squeeze Theorems
Given a nonlinear function h separating a convex and a concave function, we provide various conditions under which there exists an affine separating function whose graph is somewhe...
A. S. Lewis, R. E. Lucchetti
IJCV
2010
167views more  IJCV 2010»
13 years 2 months ago
A Solution of the Dichromatic Model for Multispectral Photometric Invariance
In this paper, we address the problem of photometric invariance in multispectral imaging making use of an optimisation approach based upon the dichromatic model. In this manner, w...
Cong Phuoc Huynh, Antonio Robles-Kelly
EJC
2008
13 years 7 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
NETWORKS
2008
13 years 7 months ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
WADS
1995
Springer
107views Algorithms» more  WADS 1995»
13 years 11 months ago
Quadrangulations of Planar Sets
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
Godfried T. Toussaint