Sciweavers

476 search results - page 93 / 96
» The Complexity of Equality Constraint Languages
Sort
View
ICGI
2010
Springer
13 years 7 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
ECIR
2009
Springer
13 years 6 months ago
Refining Keyword Queries for XML Retrieval by Combining Content and Structure
Abstract. The structural heterogeneity and complexity of XML repositories makes query formulation challenging for users who have little knowledge of XML. To assist its users, an XM...
Desislava Petkova, W. Bruce Croft, Yanlei Diao
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
14 years 9 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 9 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
CAV
2009
Springer
206views Hardware» more  CAV 2009»
14 years 9 months ago
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, ...