Sciweavers

113 search results - page 22 / 23
» Simpler is also better in approximating fixed points
Sort
View
CVPR
2000
IEEE
14 years 9 months ago
A General Method for Errors-in-Variables Problems in Computer Vision
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
Bogdan Matei, Peter Meer
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
FOCS
2008
IEEE
14 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ISCC
2006
IEEE
14 years 1 months ago
Characterizing Address Use Structure and Stability of Origin Advertisement in Inter-domain Routing
— The stability and robustness of BGP remains one of the most critical elements in sustaining today’s Internet. In this paper, we study the structure and stability of origin ad...
Sophie Y. Qiu, Patrick Drew McDaniel, Fabian Monro...
SAINT
2006
IEEE
14 years 1 months ago
Fluid-Based Analysis of a Network with DCCP Connections and RED Routers
In this paper, we model DCCP congestion control mechanism and RED as independent discrete-time systems using fluid-flow approximation. By interconnecting DCCP connections and RE...
Hiroyuki Hisamatsu, Hiroyuki Ohsaki, Masayuki Mura...