We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
This paper describes concepts and features of a Web-based system called XRL/flower for carrying out Petri-net based workflows described with XRL (eXchangeable Routing Language). XR...
Search engines are powerful tools to find information on the Web. However, they commonly return a lot of irrelevant documents when the users’ queries are not specific enough. To...
Abstract. Portal Catalogs is a popular means of searching for information on the Web. They provide querying and browsing capabilities on data organized in a hierarchy, on a categor...
Eleni G. Christodoulou, Theodore Dalamagas, Timos ...