Sciweavers

1650 search results - page 235 / 330
» The HOM problem is decidable
Sort
View
WWW
2004
ACM
16 years 7 months ago
Type based service composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
CADE
2005
Springer
16 years 6 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
VLDB
2007
ACM
89views Database» more  VLDB 2007»
16 years 6 months ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish
VLDB
2007
ACM
102views Database» more  VLDB 2007»
16 years 6 months ago
Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing
Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer...
Fei Xu, Chris Jermaine
SIGMOD
2007
ACM
123views Database» more  SIGMOD 2007»
16 years 6 months ago
Schema advisor for hybrid relational-XML DBMS
In response to the widespread use of the XML format for document representation and message exchange, major database vendors support XML in terms of persistence, querying and inde...
Mirella Moura Moro, Lipyeow Lim, Yuan-Chi Chang