11394 search results - page 64 / 2279 » Self-Organizing Data Structures |
145
click to vote
WSS
2001
15 years 2 months ago
2001
Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
SIGCSE
2005
ACM
15 years 7 months ago
2005
ACM
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
SIGCSE
1998
ACM
15 years 5 months ago
1998
ACM
tterns help narrow the gap between the abstract views of the data structures and their concrete implementations. The smaller the gap, the higher the level action. The more abstract...
137
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
Most existing structure from motion (SFM) approaches for unordered images cannot handle multiple instances of the same structure in the scene. When image pairs containing differen...