Sciweavers

1487 search results - page 178 / 298
» Representing and Querying Data Transformations
Sort
View
MICS
2008
72views more  MICS 2008»
15 years 1 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
IJCGA
2000
85views more  IJCGA 2000»
15 years 1 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
TODS
2002
92views more  TODS 2002»
15 years 1 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
125
Voted
VLDB
1994
ACM
149views Database» more  VLDB 1994»
15 years 5 months ago
Qualified Answers That Reflect User Needs and Preferences
This paper introduces a formalism to describe the needs and preferences of database users. Because of the precise formulation of these concepts, we have found an automatic and ver...
Terry Gaasterland, Jorge Lobo
TIME
2005
IEEE
15 years 7 months ago
An XML-Based Framework for Temporal Database Implementation
This paper presents an XML-based approach to implementing the parametric model of temporal databases. In the parametric model, attribute values are functions of time and the entir...
Seo-Young Noh, Shashi K. Gadia