943 search results - page 119 / 189 » How should data structures and algorithms be taught |
SBBD
2000
13 years 10 months ago
2000
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
BXML
2003
13 years 10 months ago
2003
We present an approach of how to automatically extract an XML document structure from a conceptual data model that describes the content of the document. We use UML class diagrams ...
CCCG
2008
13 years 10 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...
KDD
2009
ACM
14 years 1 months ago
2009
ACM
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
Indisputably Normalized Cuts is one of the most popular segmentation algorithms in computer vision. It has been applied to a wide range of segmentation tasks with great success. A...