6388 search results - page 321 / 1278 » High Performance Data Mining |
166
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
167
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
147
click to vote
ICDM
2005
IEEE
16 years 10 days ago
2005
IEEE
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
156
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Knowledge discovery systemsfor databasesareemployedto provide valuable insights into characteristics and relationshipsthat may exist in the data,but are unknown to the user. This ...
170
click to vote
IPPS
2003
IEEE
16 years 4 hour ago
2003
IEEE
Performance obtained with existing library-based parallelization tools for implementing high performance image processing applications is often sub-optimal. This is because inter-...