356 search results - page 36 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
75
Voted
CCCG
2006
15 years 1 months ago
2006
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
105
click to vote
JDA
2008
15 years 12 days ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
132
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
100
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
110
Voted
ICVGIP
2004
15 years 1 months ago
2004
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...