Sciweavers

1105 search results - page 112 / 221
» Linear choosability of graphs
Sort
View
DC
2011
14 years 4 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
ICIP
2006
IEEE
16 years 6 months ago
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
Ananda S. Chowdhury, Suchendra M. Bhandarkar, Robe...
DCC
2002
IEEE
16 years 4 months ago
Zero-Error Source Coding with Maximum Distortion Criterion
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
Ertem Tuncel, Prashant Koulgi, Shankar L. Regunath...
ICCSA
2009
Springer
15 years 11 months ago
YAO: A Software for Variational Data Assimilation Using Numerical Models
Variational data assimilation consists in estimating control parameters of a numerical model in order to minimize the misfit between the forecast values and some actual observatio...
Luigi Nardi, Charles Sorror, Fouad Badran, Sylvie ...
GD
2004
Springer
15 years 10 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...