Sciweavers

4378 search results - page 524 / 876
» On the Complexity of Ordered Colourings
Sort
View
EDBT
2010
ACM
200views Database» more  EDBT 2010»
16 years 1 months ago
Rewrite techniques for performance optimization of schema matching processes
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
Eric Peukert, Henrike Berthold, Erhard Rahm
LATIN
2010
Springer
16 years 1 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
AINA
2009
IEEE
16 years 1 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
HICSS
2009
IEEE
130views Biometrics» more  HICSS 2009»
16 years 1 months ago
A Systematic Approach to Improve Communication for Emergency Response
The importance of communication, information sharing and interoperability in an emergency response scenario have risen recently based on the frequency of disasters throughout the ...
Raheleh B. Dilmaghani, Ramesh R. Rao
SAC
2009
ACM
16 years 1 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke