22 search results - page 4 / 5 » On the Advantage over Random for Maximum Acyclic Subgraph |
FOCS
2009
IEEE
14 years 28 days ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
SSPR
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Statistical analysis of spatially uniform signal contexts allows Discrete Universal Denoiser (DUDE) to effectively correct signal errors caused by a discrete symmetric me...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
PIMRC
2008
IEEE
14 years 17 days ago
2008
IEEE
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
SAT
2010
Springer
13 years 4 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...