Sciweavers

148 search results - page 25 / 30
» Propagating XML Constraints to Relations
Sort
View
WWW
2004
ACM
14 years 8 months ago
Dynamic assembly of learning objects
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
Robert G. Farrell, Soyini D. Liburd, John C. Thoma...
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
14 years 1 months ago
Multi-robot SLAM with Unknown Initial Correspondence: The Robot Rendezvous Case
Abstract— This paper presents a new approach to the multirobot map-alignment problem that enables teams of robots to build joint maps without initial knowledge of their relative ...
Xun S. Zhou, Stergios I. Roumeliotis
PVLDB
2008
167views more  PVLDB 2008»
13 years 7 months ago
Managing and querying transaction-time databases under schema evolution
The old problem of managing the history of database information is now made more urgent and complex by fast spreading web information systems, such as Wikipedia. Our PRIMA system ...
Hyun Jin Moon, Carlo Curino, Alin Deutsch, Chien-Y...
SBBD
2004
119views Database» more  SBBD 2004»
13 years 9 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
AICCSA
2007
IEEE
110views Hardware» more  AICCSA 2007»
14 years 1 months ago
Benchmarking XML-Schema Matching Algorithms for Improving Automated Tuning
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...
Mohamed Boukhebouze, Rami Rifaieh, Aïcha-Nabi...