4541 search results - page 298 / 909 » Cache-Oblivious Algorithms and Data Structures |
130
click to vote
CSC
2008
15 years 5 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
146
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
170
click to vote
JMLR
2008
15 years 3 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
159
Voted
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
While Boltzmann Machines have been successful at unsupervised learning and density modeling of images and speech data, they can be very sensitive to noise in the data. In this pap...
126
click to vote
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
We study an algorithm for feature selection that clusters attributes using a special metric and then makes use of the dendrogram of the resulting cluster hierarchy to choose the m...