Sciweavers

359 search results - page 55 / 72
» Online Algorithms for Disk Graphs
Sort
View
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
GIS
2003
ACM
16 years 23 days ago
Computational data modeling for network-constrained moving objects
Advances in wireless communications, positioning technology, and other hardware technologies combine to enable a range of applications that use a mobile user's geo-spatial da...
Laurynas Speicys, Christian S. Jensen, Augustas Kl...
CVPR
2011
IEEE
14 years 7 months ago
Multiobject Tracking as Maximum Weight Independent Set
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
William Brendel, Mohamed Amer, Sinisa Todorovic
CIDM
2007
IEEE
15 years 3 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 19 hour ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar