S. Muthukrishnan Torsten Suel  Home/Search
Context
Related
| poly.edu/~suel/papers/pxp.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: poly.edu/~suel/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the problem of optimally partitioning a two-dimensional array of elements by cutting each coordinate axis into (resp., ) intervals, resulting in rectangular regions. This problem arises in several applications in databases, parallel computation, and image processing. Our main contribution are new approximation algorithms for these NP Complete problems that improve significantly over previously known bounds. The algorithms are fast and simple, work for a variety of... (Update)
Similar documents (at the sentence level):
76.8%: Approximation Algorithms for Array Partitioning Problems - Muthukrishnan Torsten Suel (Correct)
Active bibliography (related documents): More All
0.7: On Rectangular Partitionings in Two Dimensions.. - Muthukrishnan.. (1999) (Correct)
0.5: Approximations for the General Block Distribution of a Matrix - Bengt Aspvall Magn'us (1997) (Correct)
0.3: Sparse Matrix Decomposition with Optimal Load Balancing - Pinar, Aykanat (1997) (Correct)
Similar documents based on text: More All
0.2: Compact Grid Layouts of Multi-Level Networks - Muthukrishnan, Paterson.. (1999) (Correct)
0.2: Optimal Histograms with Quality Guarantees - Jagadish, Poosala, Koudas.. (1998) (Correct)
0.2: Compact Grid Layouts of Some Multi-Level Networks - Muthukrishnan, Paterson.. (1999) (Correct)
BibTeX entry: (Update)
@misc{ suel-approximation,
author = "Muthukrishnan Torsten Suel",
title = "Approximation Algorithms for Array Partitioning Problems",
url = "citeseer.ist.psu.edu/582593.html" }
Citations (may not include all citations):976 Machine Learning (context) - Mitchell - 1997
835 High Performance Fortran language specification - Fortran - 1997
394 Solving Problems on Concurrent Processors (context) - Fox, Johnson et al. - 1988
317 Learning quickly when irrelevant attributes abound: A new li.. (context) - Littlestone - 1988
152 Programming in Vienna Fortran - Chapman, Mehrotra et al. - 1992
144 symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
105 Improved histograms for selectivity estimation of range pred.. - Poosala, Ioannidis et al. - 1996
104 Equi-depth histograms for estimating selectivity factors for.. (context) - Muralikrishna, Dewitt - 1988
91 Epsilon-nets and simplex range queries (context) - Haussler, Welzl - 1987
77 Balancing histogram optimality and practicality for query re.. - Ioannidis, Poosala - 1995
63 Histogram-Based Estimation Techniques in Databases (context) - Poosala - 1997
62 Optimal histograms with quality guarantees - Jagadish, Koudas et al. - 1998
56 Universality of serial histograms (context) - Ioannidis - 1993
51 Almost optimal set covers in finite VC-dimension (context) - Bronnimann, Goodrich - 1995
45 The Optimization of Queries in Relational Databases (context) - Kooi - 1980
29 A Las Vegas algorithm for linear programming when the dimens.. (context) - Clarkson - 1995
27 Partition trees for triangle counting and other range search.. (context) - Welzl - 1988
27 Self-tuning histograms: Building histograms without looking .. - Aboulnaga, Chaudhuri - 1999
27 Rectilinear partitioning of irregular data parallel computat.. (context) - Nicol - 1994
26 Partitioning problems in parallel (context) - Bokhari - 1988
24 Array decomposition for nonuniform computational environment.. - Kaddoura, Ranka et al. - 1995
22 Personal communication (context) - Charikar, Chekuri et al. - 1996
18 Approximating multi-dimensional aggregate range queries over.. - Gunopulos, Kollios et al. - 2000
13 Efficient array partitioning - Khanna, Muthukrishnan et al. - 1997
13 Accurate estimation of the number of tuples satisfying a con.. (context) - Shapiro, Connell - 1984
13 On rectangular partitionings in two dimensions: Algorithms - Muthukrishnan, Poosala et al. - 1999
11 Structured partitioning problems (context) - Anily, Federgruen - 1991
10 Partitioning an array onto a mesh of processors - Manne, Sorevik - 1996
7 the complexity of the generalized block distribution - Grigni, Manne - 1996
5 Partitioning a matrix to minimize the maximum cost (context) - Mingozzi, Ricciardelli et al. - 1995
2 Approximations for the general block distribution of a matri.. - Aspvall, Halldorsson et al. - 2001
http://atlantis.ucc.ie/dvideo/dv.html
Documents on the same site (http://cis.poly.edu/~suel/): More
zdelta: An Efficient Delta Compression Tool - Trendafilov, Memon, Suel (2002) (Correct)
On The Scalability Of An Image Transcoding Proxy Server - Savant, Memon, Suel (2003) (Correct)
Interactive Wrapper Generation with Minimal User Effort - Irmak, Suel (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC