Sciweavers

1814 search results - page 27 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
14 years 21 days 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...
MOR
2008
73views more  MOR 2008»
13 years 9 months ago
Separation of Nonconvex Sets with General Augmenting Functions
In this paper, we consider two geometric optimization problems that are dual to each other and characterize conditions under which the optimal values of the two problems are equal...
Angelia Nedic, Asuman E. Ozdaglar
ACIVS
2009
Springer
14 years 3 months ago
A Novel Approach to Geometric Fitting of Implicit Quadrics
Abstract. This paper presents a novel approach for estimating the geometric distance from a given point to the corresponding implicit quadric curve/surface. The proposed estimation...
Mohammad Rouhani, Angel Domingo Sappa
AUTOMATICA
2008
91views more  AUTOMATICA 2008»
13 years 7 months ago
Geometric characterization on the solvability of regulator equations
The solvability of the regulator equation for a general nonlinear system is discussed in this paper by using geometric method. The `feedback' part of the regulator equation, ...
Xiaohua Xia, Jiangfeng Zhang
ICASSP
2011
IEEE
13 years 21 days ago
Geometric multichannel common signal separation with application to music and effects extraction from film soundtracks
We address the task of separation of music and effects from dialogs in film or television soundtracks. This is of interest for film studios wanting to release films in new, pre...
Juan José Burred, Pierre Leveau