943 search results - page 124 / 189 » How should data structures and algorithms be taught |
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
KDD
2012
ACM
11 years 11 months ago
2012
ACM
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
ANZIIS
1996
IEEE
14 years 1 months ago
1996
IEEE
This paper describes the design and developmentof an expert system for tourist information center. The expert system was built to recommend a suitable travel schedule that satisfi...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
KDD
2009
ACM
14 years 9 months ago
2009
ACM
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...