Sciweavers

102 search results - page 13 / 21
» Data Structures for Reporting Extension Violations in a Quer...
Sort
View
DCG
2010
289views more  DCG 2010»
13 years 7 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...
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
14 years 7 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
HICSS
1999
IEEE
98views Biometrics» more  HICSS 1999»
13 years 11 months ago
Retrieval of Volatile Database Output through Hypermedia Applications
This paper reports on research on the generation of hypermedia (Web) applications for querying multimedia databases. In [5] we have proposed a heuristic algorithm for generating n...
Geert-Jan Houben, Paul De Bra
HICSS
2003
IEEE
107views Biometrics» more  HICSS 2003»
14 years 24 days ago
The Customer-Centric Data Warehouse - An Architectural Approach to Meet the Challenges of Customer Orientation
This paper presents research-in-progress. An extensive customer-centric data warehouse architecture should enable both complex analytical queries as well as standard reporting que...
Hans-Georg Kemper, Phil-Lip Lee