Sciweavers

406 search results - page 71 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
ADCM
2010
147views more  ADCM 2010»
13 years 10 months ago
Edge offset meshes in Laguerre geometry
A mesh M with planar faces is called an edge offset (EO) mesh if there exists a combinatorially equivalent mesh M d such that corresponding edges of M and M d lie on parallel lines...
Helmut Pottmann, Philipp Grohs, Bernhard Blaschitz
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
13 years 10 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
COMGEO
2010
ACM
13 years 10 months ago
An efficient algorithm for the stratification and triangulation of an algebraic surface
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
Eric Berberich, Michael Kerber, Michael Sagraloff
COR
2010
177views more  COR 2010»
13 years 10 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
CORR
2010
Springer
80views Education» more  CORR 2010»
13 years 10 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...