Sciweavers

7129 search results - page 857 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ICA
2004
Springer
15 years 11 months ago
Blind Deconvolution of SISO Systems with Binary Source Based on Recursive Channel Shortening
We treat the problem of Blind Deconvolution of Single Input - Single Output (SISO) systems with real or complex binary sources. We explicate the basic mathematical idea by focusing...
Konstantinos I. Diamantaras, Theophilos Papadimitr...
ISAAC
2004
Springer
207views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Pareto Optimality in House Allocation Problems
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
David J. Abraham, Katarína Cechlárov...
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 11 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
IWCIA
2004
Springer
15 years 11 months ago
An Efficient Euclidean Distance Transform
Within image analysis the distance transform has many applications. The distance transform measures the distance of each object point from the nearest boundary. For ease of computa...
Donald G. Bailey
IWPEC
2004
Springer
15 years 11 months ago
Packing Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Luke Mathieson, Elena Prieto, Peter Shaw