Sciweavers

6740 search results - page 74 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
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
ICIP
2003
IEEE
14 years 11 months ago
Robust line detection using a weighted MSE estimator
In this paper we introduce a novel line detection algorithm based on a weighted minimum mean square error (MSE) formulation. This algorithm has been developed to enable an autonom...
Guido M. Schuster, Aggelos K. Katsaggelos
TIS
1998
59views more  TIS 1998»
13 years 9 months ago
Information Access in Africa: Problems with Every Channel
: Every information channel within Africa is restricted. Limited budgets cause televison stations to produce few shows of their own and to fill airtime with cheap American imports ...
William Wresch
APPROX
2004
Springer
165views Algorithms» more  APPROX 2004»
14 years 3 months ago
Approximating Additive Distortion of Embeddings into Line Metrics
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
Kedar Dhamdhere
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 10 months ago
A General Framework for Graph Sparsification
Given a weighted graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtain a...
Ramesh Hariharan, Debmalya Panigrahi