Sciweavers

794 search results - page 65 / 159
» Improved algorithms for orienteering and related problems
Sort
View
ARITH
2003
IEEE
14 years 2 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
ICASSP
2011
IEEE
13 years 24 days ago
A robust clock synchronization algorithm for wireless sensor networks
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
Jang-Sub Kim, Jaehan Lee, Erchin Serpedin, Khalid ...
CAIP
1999
Springer
138views Image Analysis» more  CAIP 1999»
14 years 1 months ago
Procrustes Alignment with the EM Algorithm
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the...
Bin Luo, Edwin R. Hancock
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
14 years 3 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 9 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis