1949 search results - page 49 / 390 » Random graphs on surfaces |
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
CPC
2006
14 years 12 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
105
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we present a method of combining stereo and shape-from-shading information, taking account of the local reliability of each shape estimate. Local estimates of dispar...
116
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
TVCG
2008
14 years 11 months ago
2008
Abstract-- We present a novel GPU-based algorithm for highquality rendering of bivariate spline surfaces. An essential difference to the known methods for rendering graph surfaces ...