4536 search results - page 286 / 908 » Contention-Sensitive Data Structures and Algorithms |
187
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
In Proc. of IEEE Conf. on CVPR'2000, Vol.I, pp.222-227, Hilton Head Island, SC, 2000 In many vision applications, the practice of supervised learning faces several difficulti...
156
click to vote
AUSAI
2007
Springer
16 years 27 days ago
2007
Springer
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
137
click to vote
IWCIA
2004
Springer
16 years 2 days ago
2004
Springer
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new ...
198
click to vote
SIGMOD
2000
ACM
15 years 11 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
150
click to vote
JIIS
2006
15 years 6 months ago
2006
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...