Sciweavers

48 search results - page 7 / 10
» Fixed Parameter Algorithms for the Minimum Weight Triangulat...
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
13 years 11 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
ICIP
2003
IEEE
14 years 9 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
MOC
2010
13 years 2 months ago
H(div) preconditioning for a mixed finite element formulation of the diffusion problem with random data
We study H(div) preconditioning for the saddle-point systems that arise in a stochastic Galerkin mixed formulation of the steady-state diffusion problem with random data. The key i...
Howard C. Elman, Darran G. Furnival, Catherine E. ...
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 9 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ICML
2010
IEEE
13 years 8 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein