Sciweavers

895 search results - page 23 / 179
» Using graphs for some discrete tomography problems
Sort
View
WG
2000
Springer
13 years 11 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano
ICIP
2009
IEEE
13 years 5 months ago
Optical flow and depth from motion for omnidirectional images using a TV-L1 variational framework on graphs
This paper deals with the problem of efficiently computing the optical flow of image sequences acquired by omnidirectional (nearly full field of view) cameras. We formulate the pr...
Luigi Bagnato, Pascal Frossard, Pierre Vandergheyn...
WSC
2004
13 years 8 months ago
Efficient Simulation-Based Discrete Optimization
In many practical applications of simulation it is desirable to optimize the levels of integer or binary variables that are inputs for the simulation model. In these cases, the ob...
Seth D. Guikema, Rachel A. Davidson, Zehra Ç...
JCSC
1998
227views more  JCSC 1998»
13 years 7 months ago
Continuous and Hybrid Petri Nets
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
Hassane Alla, René David
CAGD
2006
72views more  CAGD 2006»
13 years 7 months ago
Discrete one-forms on meshes and applications to 3D mesh parameterization
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
Steven J. Gortler, Craig Gotsman, Dylan Thurston