3241 search results - page 403 / 649 » Challenges for Dataset Search |
127
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
264
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
277
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
185
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
247
click to vote
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...