686 search results - page 45 / 138 » Minimax Probability Machine |
SPAA
2006
ACM
14 years 4 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
PAM
2010
Springer
14 years 8 days ago
2010
Springer
We estimate the number of active machines per hour infected with the Conficker-C worm, using a probability model of Conficker-C's UDP P2P scanning behavior. For an observer wi...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...