11211 search results - page 70 / 2243 » Rank-Sensitive Data Structures |
SIGCSE
2005
ACM
14 years 4 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
14 years 3 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...
MTA
1998
13 years 10 months ago
1998
Traditional browsing of large multimedia documents (e.g., video, audio) is primarily sequential. In the absence of an index structure browsing and searching for relevant informatio...
IJDAR
2002
13 years 10 months ago
2002
Abstract. In this paper, we present a logical representation for form documents to be used for identification and retrieval. A hierarchical structure is proposed to represent the s...
KDD
2004
ACM
14 years 11 months ago
2004
ACM