Sciweavers

493 search results - page 64 / 99
» Quantum Query Complexity of Some Graph Problems
Sort
View
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
14 years 8 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
ICCSA
2009
Springer
15 years 4 months ago
Designing Data Warehouses for Geographic OLAP Querying by Using MDA
Data aggregation in Geographic Information Systems (GIS) is a desirable feature, spatial data are integrated in OLAP engines for this purpose. However, the development and operatio...
Octavio Glorio, Juan Trujillo
DOLAP
2005
ACM
14 years 11 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
EDBT
2010
ACM
153views Database» more  EDBT 2010»
15 years 4 months ago
Suggestion of promising result types for XML keyword search
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
TCAD
2008
128views more  TCAD 2008»
14 years 9 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...