Sciweavers

905 search results - page 53 / 181
» On the Complexity of uSPR Distance
Sort
View
TELSYS
2002
73views more  TELSYS 2002»
14 years 9 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
14 years 8 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
ICIP
2008
IEEE
15 years 11 months ago
Local feature extraction for video copy detection in a database
In this paper a new content-based copy identification method for video sequences is presented. It is robust to a number of image transformations and particulary robust to compress...
Ehsan Maani, Sotirios A. Tsaftaris, Aggelos K. Kat...
ICPR
2002
IEEE
15 years 11 months ago
View-Based Dynamic Object Recognition Based on Human Perception
Psychophysical studies have shown that humans actively exploit temporal information such as contiguity of images in object recognition. We have recently developed a recognition sy...
Arnulf B. A. Graf, Christian Wallraven, Heinrich H...
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
15 years 10 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein