4541 search results - page 621 / 909 » Cache-Oblivious Algorithms and Data Structures |
174
click to vote
SPIRE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
217
click to vote
ECCV
2004
Springer
16 years 18 days ago
2004
Springer
Often in neurosurgical planning a dual echo acquisition is performed that yields proton density (PD) and T2-weighted images to evaluate edema near a tumour or lesion. The developme...
178
click to vote
IFIP
2004
Springer
16 years 17 days ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
170
click to vote
WCRE
1993
IEEE
15 years 11 months ago
1993
IEEE
Recognizing commonly used data structures and algorithms is a key activity in reverse engineering. Systems developed to automate this recognition process have been isolated, stand...
217
click to vote
BIRTHDAY
2008
Springer
15 years 9 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...