Sciweavers

1650 search results - page 289 / 330
» The HOM problem is decidable
Sort
View
PODS
2010
ACM
173views Database» more  PODS 2010»
14 years 23 days ago
Foundations of schema mapping management
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
TAMC
2009
Springer
14 years 7 days ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo
ICCBR
2001
Springer
14 years 4 days ago
Mining High-Quality Cases for Hypertext Prediction and Prefetching
Case-based reasoning aims to use past experience to solve new problems. A strong requirement for its application is that extensive experience base exists that provides statisticall...
Qiang Yang, Ian Tian Yi Li, Henry Haining Zhang
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
14 years 1 days ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
ICFP
1999
ACM
14 years 12 hour ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...