115 search results - page 22 / 23 » Hardness and Approximation Results for Packing Steiner Trees |
DOLAP
2003
ACM
13 years 11 months ago
2003
ACM
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
VRST
2003
ACM
13 years 11 months ago
2003
ACM
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
KDD
2003
ACM
14 years 6 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
ATAL
2009
Springer
13 years 7 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...