81 search results - page 12 / 17 » Even Faster Algorithm for Set Splitting! |
ISVC
2005
Springer
14 years 18 days ago
2005
Springer
In this paper, we propose a method for directly rendering point sets which only have positional information by using recent graphics processors (GPUs). Almost all the algorithms in...
ICML
2009
IEEE
14 years 1 months ago
2009
IEEE
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
CSR
2009
Springer
14 years 1 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
JMLR
2006
13 years 7 months ago
2006
We study some stability properties of algorithms which minimize (or almost-minimize) empirical error over Donsker classes of functions. We show that, as the number n of samples gr...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...