• Aucun résultat trouvé

Workshop Programme and Participant List

N/A
N/A
Protected

Academic year: 2022

Partager "Workshop Programme and Participant List"

Copied!
3
0
0

Texte intégral

(1)

Workshop programme

Thursday 16.4. - morning (9:00-11:45)

Speeding Up Shortest Path Search in Public Transport Networks

Vladislav Martinek, Michal Zemlička 9:00-9:25

Using Top Trees For Easy Programming of Tree Algorithms

Michal Vajbar 9:25-9:50

The BPM to UML activity diagram transformation using XSLT Ondrej Macek, Karel Richta

9:50- 10:15

Coffee break 10:15-

10:30

Five-Level Multi-Application Schema Evolution Martin Necasky, Irena Mlynková

10:30- 10:55 Tequila - a query language for the Semantic Web

Jakub Galgonek

10:55- 11:20 XML-lambda Type System and Data Model Revealed

Pavel Loupal

11:20- 11:45

Lunch 12:00-

13:00

Thursday 16.4. - afternoon (16:00-17:50)

Translation of Ontology Retrieval Problem into Relational Queries Jaroslav Pokorny, Jana Pribolova, Peter Vojtas

16:00- 16:25 Compression of the Stream Array Data Structure

Radim Baca, Martin Pawlas (presented by Michal Kratky)

16:25- 16:50

Break 16:50-

17:00

Dimension Reduction Methods for Iris Recognition Pavel Moravec, Vaclav Snasel

17:00- 17:25 From Web Pages to Web Communities

Milos Kudelka, Vaclav Snasel, Zdenek Horak, Aboul Ella Hassanien

17:25- 17:50

Dinner 18:00-

19:00

Thursday 16.4. - evening (19:00-20:50)

Various aspects of user preference learning and recommender systems Alan Eckhardt

19:00- 19:25 Benchmarking Coding Algorithms for the R-tree Compression

Jiří Walder, Michal Kratky, Radim Baca

19:25- 19:50

Break 19:50-

(2)

20:00

Efficiency Improvement of Narrow Range Query Processing in R-tree Peter Chovanec, Michal Kratky

20:00- 20:25 Combination of TA- and MD-algorithm for Efficient Solving of

Top-K Problem according to User's Preferences Matus Ondreicka, Jaroslav Pokorny

20:25- 20:50

Participant list

Pavel Moravec, Ing. Ph.D.

Karel Richta, Doc.Ing.CSc Pavel Loupal, Ing.

Ondrej Macek Ing.

Jan Stoklasa, Mgr.

Michal Valenta, Ing., Ph.D.

Jana Pribolova, RNDr.

Peter Gursky, RNDr. PhD.

David Toth, Ing.

Tomas Skopal Michal Vajbar, Mgr.

Jakub Galgonek, Mgr.

RNDr. Alan Eckhardt

prof. RNDr. Peter Vojtas, DrSc.

Pavel Janecek, Ing.

Vladislav Martinek Martin Necasky, Ph.D.

Matus Ondreicka, Mgr.

Prof. Jaroslav Pokorny

(3)

Michal Kratky Jiří Walder, Ing.

Peter Chovanec, Ing.

Ing. Radim Baca, Ph.D.

Zdenek Horak, Mgr.

Références

Documents relatifs

This is a very nice and simple interface, and allows for easy combination of arbitrary operators,but it clearly comes from a time when query processing was dominated by

According to type of object attributes it is possible to store a set of objects in MDB-tree, in Fagin’s lists or in data structure, which MXT-algorithm uses.. Moreover, MXT-

In this article, we present an improvement of Signature R-tree, data structure for the efficient processing of narrow range queries7. Moreover, we introduce an en- hanced

UNESCO Regional Support Team for East and Southern Africa, Johannesburg, South

— En dim n, toute famille libre possède au plus n vecteurs et toute famille génératrice possède au moins n vecteurs.. — En dim n, toute famille libre de cardinal n est une base

This is particularly relevant to the development of language interfaces for spatial systems where the types of representation and reasoning used by applications such as robots

(b) Subsequent anneal leads to the recrystallization of the amorphous regions through solid phase epitaxial regrowth (SPER) and dopant atoms are incorporated into lattice

Assume that for each edge e, on average, there are 16 potential outgN um(lbl(e)) from each node. Thus, on average, we need 4 bits to represent each edge of the query. Based on