943 search results - page 96 / 189 » How should data structures and algorithms be taught |
PKDD
1999
Springer
15 years 2 months ago
1999
Springer
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
CPM
2007
Springer
15 years 1 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
112
click to vote
KDD
2012
ACM
13 years 7 days ago
2012
ACM
Given huge collections of time-evolving events such as web-click logs, which consist of multiple attributes (e.g., URL, userID, timestamp), how do we find patterns and trends? Ho...
NIPS
2000
14 years 11 months ago
2000
The Vicinal Risk Minimization principle establishes a bridge between generative models and methods derived from the Structural Risk Minimization Principle such as Support Vector M...