492 search results - page 68 / 99 » Empirical Comparison of |
123
click to vote
ML
2010
ACM
14 years 11 months ago
2010
ACM
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
172
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
127
click to vote
NIPS
1990
15 years 2 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
109
click to vote
TIP
2008
15 years 1 months ago
2008
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
PR
2008
15 years 1 months ago
2008
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...