• Aucun résultat trouvé

Booklet with Programme and Participant List

N/A
N/A
Protected

Academic year: 2022

Partager "Booklet with Programme and Participant List"

Copied!
5
0
0

Texte intégral

(1)

Charles University in Prague

Faculty of Mathematics and Physics Department of Software Engineering

Databases, Texts

Specifications, and Objects

2007

http://www.cs.vsb.cz/dateso/2007/en/

http://www.ceur-ws.org/Vol-235/

April 18 – 20, 2007

Desn´ a – ˇ Cern´ a ˇ R´ıˇcka

(2)

Workshop Programme

Morning Block (9:00–11:45)

9:00–9:25 Syllable-Based Burrows-Wheeler Transform Jan L´ansk´y, Katsiaryna Chernik, Zuzana Vlˇckov´a

9:25–9:50 Improvement of Text Compression Parameters Using Cluster Analysis

Jiˇr´ı Dvorsk´y, Jan Martinoviˇc

9:50–10:15 Genetic Algorithms in Syllable-Based Text Compression Tom´aˇs Kuthan, Jan L´ansk´y

10:15–10:30 Break

10:30–10:55 Using XSEM for Modeling XML Interfaces of Services in SOA

Martin Neˇcask´y

10:55–11:20 A Modular XQuery Implementation Jan Vran´y, Jan ˇZ´ak

11:20–11:45 A Content-Oriented Data Model for Semistructured Data Tom´aˇs Novotn´y

Poster session (15:45–16:15)

(15:45–16:00) Work with Knowledge on the Internet - Local Search Anton´ın Pavl´ıˇcek, Josef Muknˇsn´abl

(16:00–16:15) The Use of Ontologies in Wrapper Induction Marek Nekvasil

Afternoon Block (16:15-18:10)

16:15–16:40 Index-Based Approach to Similarity Search in Protein and Nucleotide Databases

David Hoksza, Tom´aˇs Skopal

16:40–17:05 Using BMH Algorithm to Solve Subset of XPath Queries David Toth

17:05–17:15 Break

(3)

Workshop Programme (cont.)

17:15–17:40 Shape Extraction Framework for Similarity Search in Image Databases

Jan Kl´ıma, Tom´aˇs Skopal

17:40–18:05 Inductive Models of User Preferences for Semantic Web Alan Eckhardt

(4)

Participant List

Jiˇr´ı Dvorsk´y, doc. Ph.D. FEI, VˇSB-TU Ostrava, 17. listopadu 15, 708 33 Ostrava-Poruba, CZ, E-mail: [email protected]

Alan Eckhardt, Mgr., MFF UK, Malostransk´e n´amˇest´ı 25, Praha 1, CZ, E-mail: [email protected]

David Hoksza, Mgr., MFF UK, Malostransk´e n´amˇest´ı 25, Praha 1, CZ, E-mail:

[email protected]

Tom´aˇs Kuthan, MFF UK, Malostransk´e n´amˇest´ı 25, Praha 1, CZ, E-mail:

[email protected]

Jan L´ansk´y, Mgr., MFF UK, Malostransk´e n´amˇest´ı 25, Praha 1, CZ, E-mail:

[email protected]

Pavel Loupal, Ing.(excused), FEL ˇCVUT, Karlovo n´amˇest´ı 13, 121 35 Praha 2, CZ, E-mail: [email protected]

Jan Martinoviˇc, Ing. FEI, VˇSB-TU Ostrava, 17. listopadu 15, 708 33 Ostrava- Poruba, CZ, E-mail: [email protected]

Pavel Moravec, Ing. Ph.D., FEI, VˇSB-TU Ostrava, 17. listopadu 15, 708 33 Ostrava-Poruba, CZ, E-mail: [email protected]

Martin Neˇcask´y, Mgr., MFF UK, Malostransk´e n´amˇest´ı 25, Praha 1, CZ, E-mail: [email protected]

Marek Nekvasil, Ing., VˇSE Praha, N´am. W. Churchilla 4, 130 67 Praha 3, CZ, E-mail: [email protected]

Tom´aˇs Novotn´y, E-mail: [email protected]

Anton´ın Pavl´ıˇcek, PhDr. Ing., VˇSE Praha, N´am. W. Churchilla 4, 130 67 Praha 3, CZ, E-mail:[email protected], www.antoninpavlicek.cz

Jaroslav Pokorn´y, prof. RNDr. CSc., MFF UK, Malostransk´e n´amˇest´ı 25, Praha 1, CZ, E-mail: [email protected]

Karel Richta, doc. Ing. CSc., FEL ˇCVUT, Karlovo n´amˇest´ı 13, 121 35 Praha 2, CZ, E-mail: [email protected], http://cs.felk.cvut.cz/~richta Tom´aˇs Skopal, RNDr. Ph.D., MFF UK, Malostransk´e n´amˇest´ı 25, Praha 1, CZ, E-mail: [email protected]

(5)

V´aclav Sn´aˇsel, prof., FEI, VˇSB-TU Ostrava, 17. listopadu 15, 708 33 Ostrava- Poruba, CZ, E-mail: [email protected]

David, Toth, Ing., FEL ˇCVUT, Karlovo n´amˇest´ı 13, 121 35 Praha 2, CZ, E-mail: [email protected]

Michal Valenta, Ing., FEL ˇCVUT, Karlovo n´amˇest´ı 13, 121 35 Praha 2, CZ, E-mail: [email protected]

Jan Vran´y, Ing., FEL ˇCVUT, Karlovo n´amˇest´ı 13, 121 35 Praha 2, CZ, E-mail: [email protected]

Notes

Références

Documents relatifs

[r]

Une image numérique est un ensemble discret de points appelés PIXELS (contraction de PICTure ELements). Elle a pour vocation d’être affichée sur un écran. Chaque pixel possède

In our framework, the different shape matching algorithms are seen as ‘im- plicit’ definitions of cross-world similarity relations: a cross-world relation E H 1 goes from the world

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

Jan Platoš, Jana Kočíbová, Pavel Krömer, Pavel Moravec, Václav Snášel 10:55-11:20 Developing Genetic Algorithms for Boolean Matrix Factorization. Václav Snášel, Jan Platoš,

Consequently, the similarity assessment (score of alignment) can be used in retrieval of sequences from a database similar to a query sequence.. 2.1 Dot

The idea of Image and Vector Processing Framework [2] is to separate objects that usually figure in image processing (color bitmaps, grayscale bitmaps, binary bitmaps, gradient

DrSc., MFF UK, Malostranské náměstí 25, Praha 1, CZ, E-mail: