Sciweavers

477 search results - page 92 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 19 days ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
14 years 1 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
CVPR
2004
IEEE
14 years 10 months ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
GLOBECOM
2009
IEEE
14 years 3 months ago
Hierarchical Network Formation Games in the Uplink of Multi-Hop Wireless Networks
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...
Walid Saad, Quanyan Zhu, Tamer Basar, Zhu Han, Are...
DEXA
2008
Springer
132views Database» more  DEXA 2008»
13 years 10 months ago
Efficient Updates for Continuous Skyline Computations
We address the problem of maintaining continuous skyline queries efficiently over dynamic objects with d dimensions. Skyline queries are an important new search capability for mult...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku