Sciweavers

1388 search results - page 248 / 278
» Approximability of Robust Network Design
Sort
View
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 10 months ago
AS Relationships: Inference and Validation
Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and thorough knowledge of the nature and structure of the c...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, M...
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 9 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
SCN
2011
Springer
348views Communications» more  SCN 2011»
13 years 4 months ago
MANET QoS support without reservations
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...
Soon-Young Oh, Gustavo Marfia, Mario Gerla
CVPR
2009
IEEE
1468views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Hardware-Efficient Belief Propagation
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
Chao-Chung Cheng, Chia-Kai Liang, Homer H. Chen, L...
ECCV
2004
Springer
14 years 11 months ago
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
This article proposes a solution of the Lambertian Shape From Shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solutions. The power ...
Emmanuel Prados, Olivier D. Faugeras