943 search results - page 17 / 189 » How should data structures and algorithms be taught |
SPAA
2010
ACM
14 years 9 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
SIGCOMM
2010
ACM
14 years 9 months ago
2010
ACM
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
IAJIT
2008
14 years 9 months ago
2008
: Information retrieval tries to identify relevant documents for an information need. The problems that an IR system should deal with include document indexing (which tries to extr...
160
Voted
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...