Sciweavers

6274 search results - page 228 / 1255
» From query complexity to computational complexity
Sort
View
DAWAK
2008
Springer
15 years 6 months ago
Mining Conditional Cardinality Patterns for Data Warehouse Query Optimization
Abstract. Data mining algorithms are often embedded in more complex systems, serving as the provider of data for internal decision making within these systems. In this paper we add...
Mikolaj Morzy, Marcin Krystek
ICCSA
2009
Springer
15 years 11 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
ISVC
2009
Springer
15 years 9 months ago
Deformable Proximity Queries and Their Application in Mobile Manipulation Planning
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
Marc Gissler, Christian Dornhege, Bernhard Nebel, ...
ICRA
2007
IEEE
126views Robotics» more  ICRA 2007»
15 years 11 months ago
A Force-Feedback Algorithm for Adaptive Articulated-Body Dynamics Simulation
— This paper introduces a novel algorithm for haptic interaction with an adaptive simulation of articulated-body dynamics. Our algorithm has a multi-threaded structure, which all...
Sandy Morin, Stephane Redon
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
16 years 2 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He