Sciweavers

2922 search results - page 328 / 585
» On Relationships Between Query Models
Sort
View
FOCS
2009
IEEE
15 years 9 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
SIGMOD
1996
ACM
154views Database» more  SIGMOD 1996»
15 years 7 months ago
METU Interoperable Database System
METU INteroperable Database System (MIND) is a multidatabase system that aims at achieving interoperability among heterogeneous, federated DBMSs. MIND architecture is based on OMG...
Asuman Dogac, Ugur Halici, Ebru Kilic, Gökhan...
PLDI
2012
ACM
13 years 5 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...
SIGIR
1999
ACM
15 years 7 months ago
Information Retrieval Based on Context Distance and Morphology
We present an approach to information retrieval based on context distance and morphology. Context distance is a measure we use to assess the closeness of word meanings. This conte...
Hongyan Jing, Evelyne Tzoukermann
ICDAR
2003
IEEE
15 years 8 months ago
A Constraint-based Approach to Table Structure Derivation
er presents an approach to deriving an abstract geometric model of a table from a physical representation. The technique developed uses a graph of constraints between cells which ...
Matthew Hurst