id,collection,dc.contributor.author,dc.date.accessioned,dc.date.available,dc.date.issued,dc.description.abstract[de],dc.format.extent,dc.identifier.uri,dc.language,dc.relation.ispartofseries,dc.rights.uri,dc.subject,dc.subject.ddc,dc.title,dc.type,dcterms.accessRights.openaire,refubium.affiliation.other,refubium.affiliation[de],refubium.mycore.derivateId,refubium.mycore.fudocsId,refubium.resourceType.isindependentpub,refubium.series.name,refubium.series.reportNumber "132a1e02-8659-40cc-8d9f-828894bb4a8e","fub188/17746","Efrat, Alon||Hoffmann, Frank||Knauer, Christian||Kriegel, Klaus||Rote, Günter||Wenk, Carola","2018-06-08T08:11:36Z","2009-10-29T12:52:14.847Z","2001","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 efficient 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.","12 S.","https://refubium.fu-berlin.de/handle/fub188/19538||http://dx.doi.org/10.17169/refubium-23185","eng","urn:nbn:de:kobv:188-fudocsseries000000000021-2","http://www.fu-berlin.de/sites/refubium/rechtliches/Nutzungsbedingungen","Algorithms and data structures||Computational geometry||Approximation algorithm||Set cover||Proteomics","000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung; Informatik||500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik","Covering with ellipses","Arbeitspapier","open access","Institut für Informatik:::6dd1f8be-8a6d-4a4a-8f8d-572eb83788da:::600","Mathematik und Informatik","FUDOCS_derivate_000000000775","FUDOCS_document_000000004104","no","Freie Universität Berlin, Fachbereich Mathematik und Informatik","01-8"