943 search results - page 97 / 189 » How should data structures and algorithms be taught |
SDM
2010
SIAM
14 years 11 months ago
2010
SIAM
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose a new topological data structure for representing a set of polygonal curves embedded in a meshed surface. In this embedding, the vertices of the curve do not necessaril...
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...