Sciweavers

389 search results - page 68 / 78
» A Correspondence Metric for Imitation
Sort
View
TWC
2008
113views more  TWC 2008»
14 years 9 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
TON
2002
91views more  TON 2002»
14 years 9 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
MTA
2010
175views more  MTA 2010»
14 years 8 months ago
Building a web-scale image similarity search system
As the number of digital images is growing fast and Content-based Image Retrieval (CBIR) is gaining in popularity, CBIR systems should leap towards Webscale datasets. In this paper...
Michal Batko, Fabrizio Falchi, Claudio Lucchese, D...
CVPR
2008
IEEE
15 years 11 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
IPMI
2009
Springer
15 years 10 months ago
DRAMMS: Deformable Registration via Attribute Matching and Mutual-Saliency weighting
A general-purpose deformable registration algorithm referred to as ”DRAMMS” is presented in this paper. DRAMMS adds to the literature of registration methods that bridge betw...
Yangming Ou, Christos Davatzikos