356 search results - page 17 / 72 » Revisiting the Paxos Algorithm |
CVPR
2006
IEEE
14 years 8 months ago
2006
IEEE
This paper proposes a Riemannian geometric framework to compute averages and distributions of point configurations so that different configurations up to affine transformations ar...
CCCG
2007
13 years 8 months ago
2007
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
WCRE
2002
IEEE
13 years 11 months ago
2002
IEEE
Machine code disassembly routines form a fundamental component of software systems that statically analyze or modify executable programs. The task of disassembly is complicated by...
CP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...