5100 search results - page 338 / 1020 » The Linear Complexity of a Graph |
142
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
136
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
145
click to vote
3DPVT
2006
IEEE
15 years 11 months ago
2006
IEEE
A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set....
347
click to vote
PAMI
2010
15 years 3 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
145
click to vote
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...