Sciweavers

685 search results - page 48 / 137
» Closure Operators for Order Structures
Sort
View
PC
2010
196views Management» more  PC 2010»
15 years 11 days ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
TCS
1998
15 years 1 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
ICDT
2010
ACM
163views Database» more  ICDT 2010»
15 years 29 days ago
Composing Local-As-View Mappings
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia Arocena, Ariel Fuxman, Renee Miller
ER
2007
Springer
103views Database» more  ER 2007»
15 years 8 months ago
Ensuring the Semantic Correctness of Complex Regions
Ensuring the semantic and topological correctness of spatial data is an important requirement in geographical information systems and spatial database systems in order to preserve ...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...
PLPV
2010
ACM
15 years 10 months ago
Singleton types here, singleton types there, singleton types everywhere
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
Stefan Monnier, David Haguenauer