11211 search results - page 2022 / 2243 » Rank-Sensitive Data Structures |
123
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
137
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present the design and implementation of a new inexact Newton type algorithm for solving large-scale bundle adjustment problems with tens of thousands of images. We ex...
121
click to vote
ECAL
2007
Springer
15 years 7 months ago
2007
Springer
Often the selfish and strong are believed to be favored by natural selection, even though cooperative interactions thrive at all levels of organization in living systems. Recent em...
111
click to vote
CAV
2010
Springer
15 years 7 months ago
2010
Springer
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
127
click to vote
CAV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...