<?xml version="1.0"?><rdf:RDF xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:edm="http://www.europeana.eu/schemas/edm/" xmlns:wgs84_pos="http://www.w3.org/2003/01/geo/wgs84_pos" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:rdaGr2="http://rdvocab.info/ElementsGr2" xmlns:oai="http://www.openarchives.org/OAI/2.0/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:ore="http://www.openarchives.org/ore/terms/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:dcterms="http://purl.org/dc/terms/"><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-T00BLQRA/581750f7-ac4d-4fca-b83e-29bc9db9265f/PDF"><dcterms:extent>192 KB</dcterms:extent></edm:WebResource><edm:WebResource rdf:about="http://www.dlib.si/stream/URN:NBN:SI:doc-T00BLQRA/9ebd9fd7-1841-4c22-a7d1-0aa59fe3c2a9/TEXT"><dcterms:extent>15 KB</dcterms:extent></edm:WebResource><edm:TimeSpan rdf:about="1977-2026"><edm:begin xml:lang="en">1977</edm:begin><edm:end xml:lang="en">2026</edm:end></edm:TimeSpan><edm:ProvidedCHO rdf:about="URN:NBN:SI:doc-T00BLQRA"><dcterms:isPartOf rdf:resource="https://www.dlib.si/details/URN:NBN:SI:spr-EE5UIE2V" /><dcterms:issued>2006</dcterms:issued><dc:creator>Cabello, Sergio</dc:creator><dc:creator>DeVos, Matt</dc:creator><dc:creator>Mohar, Bojan</dc:creator><dc:format xml:lang="sl">številka:3</dc:format><dc:format xml:lang="sl">letnik:30</dc:format><dc:format xml:lang="sl">str. 289-293</dc:format><dc:identifier>ISSN:0350-5596</dc:identifier><dc:identifier>COBISSID:20378919</dc:identifier><dc:identifier>URN:URN:NBN:SI:doc-T00BLQRA</dc:identifier><dc:language>en</dc:language><dc:publisher xml:lang="sl">Slovensko društvo Informatika</dc:publisher><dcterms:isPartOf xml:lang="sl">Informatica (Ljubljana)</dcterms:isPartOf><dc:subject xml:lang="sl">gostota točk</dc:subject><dc:subject xml:lang="sl">kombinatorična geometrija</dc:subject><dc:subject xml:lang="sl">verjetnost</dc:subject><dc:subject rdf:resource="http://www.wikidata.org/entity/Q9492" /><dcterms:temporal rdf:resource="1977-2026" /><dc:title xml:lang="sl">Expected case for projecting points|</dc:title><dc:description xml:lang="sl">Consider a set of ?$n$? points in the plane with the property that any pair of points is at least at distance one. We study the expected concentration of the point set after projecting it onto a random graduated line. There is a lower bound of ?$\Omega(\sqrt{n\log n})$? given by Matoušek, and we provide an upper bound of ?$O(n^{2/3})$?</dc:description><dc:description xml:lang="sl">Za dano ?$n$?-terico točk v ravnini, ki so med seboj na razdalji vsaj 1, je obravnavan problem projekcije na slučajno premico ?$L$?, pri čemer želimo, da ima vsak interval dolžine 1 na ?$L$? čim manj projiciranih točk. Znano je, da obstajajo primeri točk, kjer vsaka projekcija vsebuje enotski interval z ?$\Omega(\sqrt{n\log n})$? projiciranimi točkami. V prispevku pa je dokazana zgornja meja ?$O(n^{2/3})$? za pričakovano vrednost</dc:description><edm:type>TEXT</edm:type><dc:type xml:lang="sl">znanstveno časopisje</dc:type><dc:type xml:lang="en">journals</dc:type><dc:type rdf:resource="http://www.wikidata.org/entity/Q361785" /></edm:ProvidedCHO><ore:Aggregation rdf:about="http://www.dlib.si/?URN=URN:NBN:SI:doc-T00BLQRA"><edm:aggregatedCHO rdf:resource="URN:NBN:SI:doc-T00BLQRA" /><edm:isShownBy rdf:resource="http://www.dlib.si/stream/URN:NBN:SI:doc-T00BLQRA/581750f7-ac4d-4fca-b83e-29bc9db9265f/PDF" /><edm:rights rdf:resource="http://rightsstatements.org/vocab/InC/1.0/" /><edm:provider>Slovenian National E-content Aggregator</edm:provider><edm:intermediateProvider xml:lang="en">National and University Library of Slovenia</edm:intermediateProvider><edm:dataProvider xml:lang="sl">Slovensko društvo Informatika</edm:dataProvider><edm:object rdf:resource="http://www.dlib.si/streamdb/URN:NBN:SI:doc-T00BLQRA/maxi/edm" /><edm:isShownAt rdf:resource="http://www.dlib.si/details/URN:NBN:SI:doc-T00BLQRA" /></ore:Aggregation></rdf:RDF>