Sciweavers

79 search results - page 16 / 16
» The pq-gram distance between ordered labeled trees
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 8 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
PAM
2007
Springer
14 years 1 months ago
Two Days in the Life of the DNS Anycast Root Servers
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
Ziqian Liu, Bradley Huffaker, Marina Fomenkov, Nev...
TALG
2008
131views more  TALG 2008»
13 years 7 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
ICPR
2006
IEEE
14 years 8 months ago
Tracking 3D Human Body using Particle Filter in Moving Monocular Camera
In this paper, we propose a method for human tracking using 3D human body model in a video sequence with a monocular moving camera. Tracking a human with unconstrained movement in...
Sungmin Kim, Chang-Beom Park, Seong-Whan Lee