205 search results - page 22 / 41 » On Approximation Algorithms for Hierarchical MAX-SAT |
102
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
TMC
2011
14 years 6 months ago
2011
—This paper describes new algorithms for throughput optimization in a mobile backbone network. This hierarchical communication framework combines mobile backbone nodes, which hav...
SIGGRAPH
1993
ACM
15 years 3 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
VMV
2001
15 years 1 months ago
2001
Sampling points with blue noise spectral characteristics are best suited for antialiasing. Compared to Poisson disk sampling, Lloyd's relaxation scheme yields samples that ap...
BMCBI
2010
14 years 12 months ago
2010
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...