1913 search results - page 142 / 383 » Using Data Mining in MURA Graphic Problems |
142
Voted
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
Bayesian text classifiers face a common issue which is referred to as data sparsity problem, especially when the size of training data is very small. The frequently used Laplacian...
127
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
171
click to vote
EGH
2011
Springer
14 years 3 months ago
2011
Springer
Texture compression helps rendering by reducing the footprint in graphics memory, thus allowing for more textures, and by lowering the number of memory accesses between the graphi...
130
click to vote
IDA
2002
Springer
15 years 3 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
146
click to vote
PC
2010
15 years 2 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...