Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk  Home/Search
Context
Related
| inf.fuberlin.de/inst/...tr0108.ps.gz 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: inf.fuberlin.d...[showYear]=2001 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We address the problem of how to cover a set of required points by a small number of axis{parallel ellipses that avoid a second set of forbidden points. We study geometric properties of such covers and present an ecient randomized approximation algorithm for the cover construction. This question is motivated by a special pattern recognition task where one has to identify ellipse-shaped protein spots in two{ dimensional electrophoresis images. (Update)
Active bibliography (related documents): More All
2.1: Covering with Ellipses - Efrat, Hoffmann, Knauer, Kriegel.. (2001) (Correct)
0.2: Randomized Algorithms for Geometric Optimization Problems - Agarwal, Sen (2000) (Correct)
0.2: A Dynamic Programming Approach to De Novo Peptide Sequencing.. - Chen, Kao, al. (2000) (Correct)
Similar documents based on text:
1.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ efrat-covering,
author = "Alon Efrat and Frank Hoffmann and Christian Knauer and Klaus Kriegel and
Günter Rote and Carola Wenk",
title = "Covering with Ellipses",
url = "citeseer.ist.psu.edu/efrat01covering.html" }
Citations (may not include all citations):317 Learning quickly when irrelevant attributes abound: A new li.. (context) - Littlestone - 1987
214 Davenport-Schinzel Sequences and Their Geometric Application.. - Sharir, Agarwal - 1995
91 Epsilon-nets and simplex range queries (context) - Haussler, Welzl - 1987
75 Approximation algorithms of the set covering and vertex cove.. (context) - Hochbaum - 1982
37 Algorithms for polytope covering and approximation - Clarkson - 1993
30 Covering polygons is hard (context) - Culberson, Reckhow - 1988
27 Partition trees for triangle counting and other range search.. (context) - Welzl - 1988
18 Ecient partition trees (context) - Matou - 1992
11 Almost optimal set covers in nite VCdimension (context) - Br, Goodrich - 1995
10 Cutting hyperplane arrangements (context) - Matou - 1991
10 Approximation algorithms for projective clustering - Agarwal, Procopiuc - 2000
5 Proteome Research: New Frontiers in Functional Genomics (context) - Wilkins, Williams et al. - 1997
2 Geometric algorithms for the analysis of 2d-electrophoresis .. (context) - Efrat, Ho et al. - 2001
2 The QUEST system for quantitative analysis of 2D gels (context) - Garrels - 1989
2 generation software package for analysis of two{dimensional .. (context) - Appel, Vargas et al. - 1997
Documents on the same site (http://www.inf.fu-berlin.de/inst/ag-ti/members/index.php?id=29&no_cache=1&L=1&tx_tipublications_pi1[showYear]=2001): More
Fast 2-Variable Integer Programming - Eisenbrand, Rote (2001) (Correct)
Nearest Neighbour Search in Hausdorff Distance Pattern Spaces - Braß, Knauer (2001) (Correct)
Expansive Motions and the Polytope of Pointed.. - Rote, Santos, Streinu (2001) (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