365 search results - page 46 / 73 » Reconfigurations in Graphs and Grids |
CORR
2007
Springer
13 years 11 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
CODES
2005
IEEE
14 years 27 days ago
2005
IEEE
System design based on static task graphs does not match well with modern consumer electronic devices with dynamic stream processing applications. We propose the TTL API for task ...
REFLECTION
2001
Springer
14 years 3 months ago
2001
Springer
, are to address what we perceive as the most pressing shortcomings of current reflective middleware platforms. First, performance: in the worst case, this needs to be on a par wit...