Sciweavers

205 search results - page 25 / 41
» On Parameterized Approximability
Sort
View
SCALESPACE
2007
Springer
14 years 3 months ago
Discrete Regularization on Weighted Graphs for Image and Mesh Filtering
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...
Sébastien Bougleux, Abderrahim Elmoataz, Ma...
ALT
2004
Springer
14 years 6 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
14 years 1 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
PVLDB
2010
97views more  PVLDB 2010»
13 years 8 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
14 years 3 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk