Back to Results
First PageMeta Content
Network theory / Search algorithms / Shortest path problem / Graph / Degree / Breadth-first search / Mathematics / Graph theory / Theoretical computer science


Sparser Relative Bundle Adjustment (SRBA): constant-time maintenance and local optimization of arbitrarily large maps Jos´e-Luis Blanco1, Javier Gonz´alez-Jim´enez2 and Juan-Antonio Fern´andez-Madrigal Abstract— In
Add to Reading List

Document Date: 2013-04-17 12:23:31


Open Document

File Size: 1,41 MB

Share Result on Facebook

Company

SIAM Journal / Markov Networks / Hp / 3M / Dynamic Bayesian Networks / Intel / YouTube / /

Country

Spain / /

/

Facility

Oxford University / University of Malaga / We store STs / University of M´alaga / University of Almer´ıa / /

IndustryTerm

updateable shortestpath spanning-tree algorithm / optimization algorithm / sparse solutions / sparse linear systems / approximate solution / constant-time solution / dog leg algorithms / bounded execution time algorithm / linear systems / /

Organization

University of Malaga / Society for Industrial Mathematics / University of Almer´ıa / Oxford University / Data association / Reserve Bank of Australia / Department of Engineering Science / University of M´alaga / Department of System Engineering and Automation / Department of Mechanical Engineering / /

Person

R. Roberts / V / Juan-Antonio Fern / Javier Gonz / /

Position

going forward / /

Product

Cowon D2+ Portable Audio Device / /

ProgrammingLanguage

C++ / /

PublishedMedium

SIAM Journal on Computing / The International Journal / /

Technology

proposed algorithm / updateable shortestpath spanning-tree algorithm / i1 Algorithm / bounded execution time algorithm / Vision algorithms / dog leg algorithms / ST algorithm / optimization algorithm / dense Cholesky algorithms / B. The algorithm / /

URL

http /

SocialTag