nedelja, 28. junij 2009 Seminar MARA

V ponedeljek, 29.6.2009, bo ob 16. uri v mali predavalnici Fakultete za matematiko, naravoslovje in informacijske tehnologije Univerze na Primorskem, Glagoljaška 8, Koper predavanje v okviru skupnega SEMINARJA ZA MATEMATICNE IN RAČUNALNIŠKE ZNANOSTI Oddelka za matematiko in računalništvo UP FAMNIT, Oddelka za matematiko in računalništvo UP PINT, Oddelka za matematiko in računalništvo UP PEF ter Oddelkov za matematiko in teoretično računalništvo IMFM.

Dnevni red

16:00 -- 17:00

Lecturer: Milan Đorđević

Title: The Complexity of TSP According to its Randomness

Abstract: How to determine and define a randomness of Traveling Salesman Problem? How to determine and define the complexity of Traveling Salesman Problem? Are these two things connected, and how? In this paper answers to these questions are presented. The probability theory, theory of numbers, and computational geometry are combined with exact measurements on conducted tests to deliver the appropriate answers to asked questions.

17:00 -- 18:00

Lecturer: Tomasz Świderek

Title: Cache-Oblivious Data Structures for Orthogonal Range Searching

Abstract:
The aim of the presentation is to show how to construct a data structure that will be optimal for orthogonal range searching.
It firsts starts with introducing the external-memory model and then continues to explain how the cache-oblivious model
is constructed. This is immediately followed by the introduction of kd-tree and van Emde Boas layout. This part of the presentation deals with how the data structure is being represented in the memory system. The final part consists of the data structure description. It starts with the explanation of how the data structure is being constructed and ends with the description of query mechanism.


Vabljeni!