![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
DATESO 2007: Desna, Czech Republic
- Jaroslav Pokorný, Václav Snásel, Karel Richta:
Proceedings of the Dateso 2007 Annual International Workshop on DAtabases, TExts, Specifications and Objects, Desna, Czech Republic, April 18-20, 2007. CEUR Workshop Proceedings 235, CEUR-WS.org 2007
Full Papers
- Jan Lansky, Katsiaryna Chernik, Zuzana Vlckova:
Syllable-Based Burrows-Wheeler Transform. - Pavel Loupal:
Updating Typed XML Documents Using a Functional Data Model. - Tomas Kuthan, Jan Lansky:
Genetic Algorithms in Syllable-Based Text Compression. - Martin Necaský:
Using XSEM for Modeling XML Interfaces of Services in SOA. - Jan Vraný, Jan Zak:
Presentation. - Tomas Novotny:
A Content-Oriented Data Model for Semistructured Data. - David Hoksza, Tomás Skopal:
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases. - David Toth:
Using BMH Algorithm to Solve Subset of XPath Queries. - Jan Klima, Tomás Skopal:
Shape Extraction Framework for Similarity Search in Image Databases. - Alan Eckhardt:
Inductive Models of User Preferences for Semantic Web. - Jiri Dvorský, Jan Martinovic:
Improvement of Text Compression Parameters Using Cluster Analysis.
Posters
- Antonín Pavlícek, Josef Muknsnabl:
Work with Knowledge on the Internet - Local Search. - Marek Nekvasil:
The Use of Ontologies in Wrapper Induction.
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.