Sciweavers

1414 search results - page 83 / 283
» Randomness and Universal Machines
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 8 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
TKDD
2008
113views more  TKDD 2008»
13 years 8 months ago
Privacy-preserving classification of vertically partitioned data via random kernels
We propose a novel privacy-preserving support vector machine (SVM) classifier for a data matrix A whose input feature columns are divided into groups belonging to different entiti...
Olvi L. Mangasarian, Edward W. Wild, Glenn Fung
IDEAL
2010
Springer
13 years 7 months ago
Typed Linear Chain Conditional Random Fields and Their Application to Intrusion Detection
Intrusion detection in computer networks faces the problem of a large number of both false alarms and unrecognized attacks. To improve the precision of detection, various machine l...
Carsten Elfers, Mirko Horstmann, Karsten Sohr, Ott...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 6 months ago
Efficient Nonnegative Matrix Factorization with Random Projections
The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical...
Fei Wang, Ping Li
SPAA
2009
ACM
14 years 9 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman