239 search results - page 20 / 48 » A Simple Algorithm for Computing the Lempel Ziv Factorizatio... |
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Bundle adjustment for multi-view reconstruction is traditionally done using the Levenberg-Marquardt algorithm with a direct linear solver, which is computationally very e...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
CORR
2010
Springer
13 years 7 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
ICCAD
2000
IEEE
13 years 11 months ago
2000
IEEE
—As the complexity of digital filters is dominated by the number of multiplications, many works have focused on minimizing the complexity of multiplier blocks that compute the co...
WINE
2005
Springer
14 years 26 days ago
2005
Springer
The assessment of credibility and reputation of contractors in online auctions is the key issue in providing reliable environment for customer-to-customer e-commerce. Confident re...