Fast Oexpected(N) Algorithm for Finding Exact Maximum distance in E2 instead of O(N^2) or O(N lgN)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43919991" target="_blank" >RIV/49777513:23520/13:43919991 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Fast Oexpected(N) Algorithm for Finding Exact Maximum distance in E2 instead of O(N^2) or O(N lgN)
Original language description
A new algorithm for finding exact maximum distance in E2 with O(N) complexity instead of O(N^2) is given. Experimental results proved speed up over 10000 times against the standard algorithm
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
AIP Conference Proceedings
ISBN
978-0-7354-1184-5
ISSN
0094-243X
e-ISSN
—
Number of pages
4
Pages from-to
2496-2499
Publisher name
AIP Publ.
Place of publication
Melville
Event location
Rhodos
Event date
Sep 21, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—