356 search results - page 7 / 72 » Revisiting the Paxos Algorithm |
ECCV
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. In this paper we introduce a principled approach to modeling the image brightness constraint for optical flow algorithms. Using a simple noise model, we derive a probabil...
CIE
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose anoth...
SIGKDD
2000
13 years 6 months ago
2000
This paper presents a simple new algorithm that performs k-means clustering in one scan of a dataset, while using a bu er for points from the dataset of xed size. Experiments show...
MP
2002
13 years 6 months ago
2002
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...
CPM
2003
Springer
13 years 12 months ago
2003
Springer
Given n fragments from k > 2 genomes, we will show how to find an optimal chain of colinear non-overlapping fragments in time O(n logk−2 n log log n) and space O(n logk−2 n...