Sciweavers

347 search results - page 17 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
92
Voted
CVPR
2006
IEEE
16 years 26 days ago
The Registration Problem Revisited: Optimal Solutions From Points, Lines and Planes
In this paper we propose a practical and efficient method for finding the globally optimal solution to the problem of pose estimation of a known object. We present a framework tha...
Carl Olsson, Fredrik Kahl, Magnus Oskarsson
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
15 years 5 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
CVPR
2006
IEEE
16 years 26 days ago
Multi-View Stereo Revisited
We present an extremely simple yet robust multi-view stereo algorithm and analyze its properties. The algorithm first computes individual depth maps using a window-based voting ap...
Michael Goesele, Brian Curless, Steven M. Seitz
ANSS
2007
IEEE
15 years 5 months ago
Revisiting the Issue of Performance Enhancement of Discrete Event Simulation Software
New approaches are considered for performance enhancement of discrete-event simulation software. Instead of taking a purely algorithmic analysis view, we supplement algorithmic co...
Alex Bahouth, Steven Crites, Norman Matloff, Todd ...
WABI
2004
Springer
15 years 4 months ago
The Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
Behshad Behzadi, Jean-Marc Steyaert