Sciweavers

3928 search results - page 195 / 786
» order 2006
Sort
View
NA
2010
96views more  NA 2010»
15 years 5 months ago
Spectral element methods on unstructured meshes: which interpolation points?
In the field of spectral element approximations, the interpolation points can be chosen on the basis of different criteria, going from the minimization of the Lebesgue constant to ...
Richard Pasquetti, Francesca Rapetti
NECO
2010
97views more  NECO 2010»
15 years 5 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
ORL
2010
85views more  ORL 2010»
15 years 5 months ago
Stable routing under the Spanning Tree Protocol
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...
Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo,...
PAMI
2010
119views more  PAMI 2010»
15 years 5 months ago
Efficient Multilevel Eigensolvers with Applications to Data Analysis Tasks
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
Dan Kushnir, Meirav Galun, Achi Brandt
PR
2010
156views more  PR 2010»
15 years 5 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier