Sciweavers

1604 search results - page 104 / 321
» Regularization on Discrete Spaces
Sort
View
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
14 years 4 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert
DCG
2010
79views more  DCG 2010»
13 years 10 months ago
Three-Dimensional Classical Groups Acting on Polytopes
Let V be a 3-dimensional vector space over a finite field. We show that any irreducible subgroup of GL(V ) that arises as the automorphism group of an regular polytope preserves a...
Peter A. Brooksbank, Deborah A. Vicinsky
APPML
2005
56views more  APPML 2005»
13 years 10 months ago
On the semigroup of linearized forced elongation
In this note we analyze the linearized equations of forced elongation. We prove that solutions of these equations are given by a quasicontraction C0-semigroup on the physically co...
Thomas Hagen
ADCM
2007
114views more  ADCM 2007»
13 years 10 months ago
Convergence analysis of online algorithms
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
Yiming Ying
FOCM
2008
140views more  FOCM 2008»
13 years 10 months ago
Online Gradient Descent Learning Algorithms
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...
Yiming Ying, Massimiliano Pontil