Sciweavers

7840 search results - page 143 / 1568
» On generalized Ramsey numbers
Sort
View
JGT
2010
103views more  JGT 2010»
14 years 11 months ago
Characterizing 3-connected planar graphs and graphic matroids
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
Manoel Lemos, Talmage James Reid, Haidong Wu
102
Voted
NIPS
2007
15 years 2 months ago
Topmoumoute Online Natural Gradient Algorithm
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
Nicolas Le Roux, Pierre-Antoine Manzagol, Yoshua B...
86
Voted
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
15 years 2 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
ICML
2006
IEEE
16 years 1 months ago
Fast particle smoothing: if I had a million particles
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
Mike Klaas, Mark Briers, Nando de Freitas, Arnaud ...
90
Voted
SAC
2010
ACM
15 years 7 months ago
Quality and perceived usefulness of process models
Modeling is now an essential ingredient in business process management and information systems development. The general usefulness of models in these areas is therefore generally ...
Peter Rittgen