Sciweavers

1388 search results - page 77 / 278
» Approximability of Robust Network Design
Sort
View
ICCV
2003
IEEE
16 years 4 months ago
Two-Frame Wide Baseline Matching
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...
Jiangjian Xiao, Mubarak Shah
261
Voted

Lecture Notes
443views
17 years 20 days ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
111
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
Weiyi Zhang, Jian Tang, Chonggang Wang, Shanaka de...
122
Voted
SASN
2005
ACM
15 years 8 months ago
The security of vehicular ad hoc networks
Vehicular networks are likely to become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat an...
Maxim Raya, Jean-Pierre Hubaux
140
Voted
JCO
2008
134views more  JCO 2008»
15 years 2 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...