default search action
DATESO 2004: Desna, Czech Republic
- Václav Snásel, Jaroslav Pokorný, Karel Richta:
Proceedings of the Dateso 2004 Annual International Workshop on DAtabases, TExts, Specifications and Objects, Desna, Czech Republic, April 14-16, 2004. CEUR Workshop Proceedings 98, CEUR-WS.org 2004, ISBN 80-248-0457-3 - Stanislav Barton:
Designing Indexing Structure for Discovering Relationships in RDF Graphs. 7-17 - Pavel Moravec, Michal Kolovrat, Václav Snásel:
LSI vs. Wordnet Ontology in Dimension Reduction for Information Retrieval. 18-26 - Tomás Skopal:
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search. 27-37 - Peter Gurský:
Storage and Retrieval of First Order Logic Terms in a Database. 38-49 - Kamil Toman:
Storing XML Data In a Native Repository. 51-62 - Radim Belohlávek, Vladimir Sklenar, Jiri Zacpal:
Concept Lattices Constrained by Attribute Dependencies. 63-73 - Petr Gajdos, Václav Snásel:
Concepts Valuation by Conjugate Moebius Inverse. 74-83 - Ondrej Sváb, Vojtech Svátek, Martin Kavalec, Martin Labský:
Querying the RDF: Small Case Study in the Bicycle Sale Domain. 84-95 - Michal Krátký, Marek Andrt:
On Efficient Part-match Querying of XML Data. 96-105 - Pavel Loupal, Michal Valenta:
INEX - a Broadly Accepted Data Set for XML Database Processing? 106-116 - Jiri Dvorský, Jan Martinovic, Václav Snásel:
Query Expansion and Evolution of Topic in Information Retrieval Systems. 117-127 - Ales Keprt:
Using Blind Search and Formal Concepts for Binary Factor Analysis. 128-140 - Marian Mindek:
Finite State Automata and Image Recognition. 141-151 - Jiri Dvorský, Michal Krátký:
Multi-dimensional Sparse Matrix Storage. 152-161 - Bohumil Horák, Václav Snásel:
Design of Structure and Realisation of Game Rules Database of Robot-Soccer Game. 162-170
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.