Sciweavers

1082 search results - page 90 / 217
» Approximation Algorithms for Spreading Points
Sort
View
MST
2007
167views more  MST 2007»
13 years 8 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 3 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
CGI
1998
IEEE
14 years 1 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
COMPGEOM
2006
ACM
14 years 3 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
HIS
2007
13 years 10 months ago
Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate efficien...
Crina Grosan, Ajith Abraham