2304 search results - page 97 / 461 » On the Vulnerability of Large Graphs |
190
click to vote
NIPS
2008
15 years 7 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
153
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
175
click to vote
GI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract: Large biomedical projects often include workflows running across institutional borders. In these workflows, data describing biomedical entities, such as patients, bio-m...
176
click to vote
IWPC
2000
IEEE
15 years 10 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
160
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...