Sciweavers

5592 search results - page 50 / 1119
» On Random Betweenness Constraints
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
ICCV
1999
IEEE
16 years 5 months ago
Neurocalibration: A Neural Network That Can Tell Camera Calibration Parameters
Camera calibration is a primary crucial step in many computer vision tasks. In this paper we present a new neural approach for camera calibration. Unlike some existing neural appr...
Moumen T. Ahmed, Elsayed E. Hemayed, Aly A. Farag
INFOCOM
2008
IEEE
15 years 10 months ago
MPLOT: A Transport Protocol Exploiting Multipath Diversity Using Erasure Codes
—In this paper, we propose a novel transport protocol that effectively utilizes available bandwidth and diversity gains provided by heterogeneous, highly lossy paths. Our Multi-P...
Vicky Sharma, Shivkumar Kalyanaraman, Koushik Kar,...
AINA
2007
IEEE
15 years 10 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
IAT
2006
IEEE
15 years 10 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler