120 search results - page 22 / 24 » Cycle lengths in sparse graphs |
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
72
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
SSS
2005
Springer
15 years 3 months ago
2005
Springer
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
120
click to vote
CP
2003
Springer
15 years 2 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...