7930 search results - page 589 / 1586 » Greedy in Approximation Algorithms |
178
click to vote
ECCC
2006
15 years 7 months ago
2006
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
182
click to vote
JMIV
2002
15 years 6 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
212
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract Parallel algorithms for the approximation of a multi-dimensional integral over an hyper-rectangular region are discussed. Algorithms based on quasi-Monte Carlo techniques ...
195
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
229
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...