Sciweavers

2766 search results - page 415 / 554
» Algorithms for trigonometric polynomials
Sort
View
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
15 years 10 months ago
Lane boundary and curb estimation with lateral uncertainties
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
Albert S. Huang, Seth J. Teller
ACCV
2009
Springer
15 years 10 months ago
A Dynamic Programming Approach to Maximizing Tracks for Structure from Motion
We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dyn...
Jonathan Mooser, Suya You, Ulrich Neumann, Raphael...
APPROX
2009
Springer
156views Algorithms» more  APPROX 2009»
15 years 10 months ago
An Analysis of Random-Walk Cuckoo Hashing
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
Alan M. Frieze, Páll Melsted, Michael Mitze...
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
15 years 10 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
COCOON
2009
Springer
15 years 10 months ago
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
Pinar Heggernes, Federico Mancini, Charis Papadopo...