Sciweavers

790 search results - page 63 / 158
» Subexponential Parameterized Algorithms
Sort
View
NIPS
1997
15 years 4 months ago
Relative Loss Bounds for Multidimensional Regression Problems
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
Jyrki Kivinen, Manfred K. Warmuth
TOG
2008
139views more  TOG 2008»
15 years 3 months ago
Logarithmic perspective shadow maps
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...
Brandon Lloyd, Naga K. Govindaraju, Cory Quammen, ...
MST
2007
167views more  MST 2007»
15 years 2 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ICIP
2010
IEEE
15 years 1 months ago
Undecimated haar thresholding for poisson intensity estimation
We propose a novel algorithm for denoising Poisson-corrupted images, that performs a signal-adaptive thresholding of the undecimated Haar wavelet coefficients. A Poisson's un...
Florian Luisier, Thierry Blu, Michael Unser
NJC
1998
86views more  NJC 1998»
15 years 2 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen