6388 search results - page 415 / 1278 » High Performance Data Mining |
232
click to vote
DEXA
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
224
click to vote
IPTPS
2005
Springer
16 years 1 months ago
2005
Springer
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
193
click to vote
SDM
2008
SIAM
15 years 9 months ago
2008
SIAM
The Universum data, defined as a collection of "nonexamples" that do not belong to any class of interest, have been shown to encode some prior knowledge by representing ...
218
click to vote
IPPS
2003
IEEE
16 years 27 days ago
2003
IEEE
Data Grids provide geographically distributed resources for large-scale data-intensive applications that generate large data sets. However, ensuring efficient access to such huge...
235
click to vote
KDD
2007
ACM
16 years 8 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...