347 search results - page 35 / 70 » The Berlekamp-Massey Algorithm revisited |
ICCV
2007
IEEE
16 years 27 days ago
2007
IEEE
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
EVOW
2009
Springer
15 years 5 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
FORMATS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
111
click to vote
AOSE
2001
Springer
15 years 3 months ago
2001
Springer
Gaining wide acceptance for the use of agents in industry requires both relating it to the nearest antecedent technology (objectoriented software development) and using artifacts ...