Sciweavers

1716 search results - page 195 / 344
» Proving Conditional Termination
Sort
View
COMBINATORICA
2010
14 years 7 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
97
Voted
JC
2010
117views more  JC 2010»
14 years 7 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski
121
Voted
JCT
2010
79views more  JCT 2010»
14 years 7 months ago
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
Rudi Pendavingh, Stefan H. M. van Zwam
JMLR
2010
145views more  JMLR 2010»
14 years 7 months ago
Kernel Partial Least Squares is Universally Consistent
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
Gilles Blanchard, Nicole Krämer
121
Voted
MOC
2010
14 years 7 months ago
Analysis of a finite PML approximation to the three dimensional elastic wave scattering problem
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...
James H. Bramble, Joseph E. Pasciak, Dimitar Trene...