Sciweavers

173 search results - page 23 / 35
» Consistent Query Answering in Data Warehouses
Sort
View
DCG
2010
289views more  DCG 2010»
13 years 9 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
INFOSCALE
2007
ACM
13 years 11 months ago
Evaluation study of a distributed caching based on query similarity in a P2P network
Several caching techniques have been used to reduce the bandwidth consumption and to provide faster answers in P2P systems. In this paper, we address the problem of reducing unnec...
Mouna Kacimi, Kokou Yétongnon
COMPGEOM
1994
ACM
14 years 1 months ago
Query-Sensitive Ray Shooting
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 10 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
AMSTERDAM
2009
13 years 7 months ago
The Data Complexity of the Syllogistic Fragments of English
Abstract. Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in ...
Camilo Thorne, Diego Calvanese