943 search results - page 62 / 189 » How should data structures and algorithms be taught |
MCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
SIAMIS
2010
14 years 4 months ago
2010
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce a novel active learning algorithm for classification of network data. In this setting, training instances are connected by a set of links to form a network, the label...
DSN
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...