4536 search results - page 8 / 908 » Contention-Sensitive Data Structures and Algorithms |
MVA
2010
13 years 6 months ago
2010
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
SIGCSE
2012
ACM
12 years 3 months ago
2012
ACM
We present CSTutor, a sketch-based interface designed to help students understand data structures. It currently supports Linked Lists, Binary Search Trees, AVL Trees, and Heaps, a...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
TIT
1998
13 years 7 months ago
1998
The paper introduces some generalizations of Vapnik’s method of structural risk minimisation (SRM). As well as making explicit some of the details on SRM, it provides a result t...
SIGCSE
1999
ACM
13 years 12 months ago
1999
ACM
We describe an approach for incorporating randomization in the teaching of data structures and algorithms. The proofs we include are quite simple and can easily