Sciweavers

10293 search results - page 77 / 2059
» Describing Semistructured Data
Sort
View
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 3 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
LPAR
2007
Springer
14 years 3 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
CSMR
2005
IEEE
14 years 3 months ago
An XML-Based Framework for Language Neutral Program Representation and Generic Analysis
XML applications are becoming increasingly popular to define structured or semi-structured constrained data in XML for special application areas. In pursuit there is a growing mom...
Raihan Al-Ekram, Kostas Kontogiannis
CHI
2004
ACM
14 years 3 months ago
Collections: flexible, essential tools for information management
While collections—aggregation mechanisms such as folders, buddy lists, photo albums, etc.—clearly play a central role in information management, the potential benefits of true...
David R. Karger, Dennis Quan
ECAI
2004
Springer
14 years 3 months ago
Type Checking in Open-Domain Question Answering
Open domain question answering (QA) systems have to bridge the potential vocabulary mismatch between a question and its candidate answers. One can view this as a recall problem and...
Stefan Schlobach, Marius Olsthoorn, Maarten de Rij...