Sciweavers

1110 search results - page 99 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
PODC
2005
ACM
15 years 4 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
CGI
2006
IEEE
15 years 5 months ago
Near-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces
Abstract. A new adaptive tessellation method for general CatmullClark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adap...
Shuhua Lai, Fuhua (Frank) Cheng
ICCV
2005
IEEE
16 years 1 months ago
Quasiconvex Optimization for Robust Geometric Reconstruction
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
Qifa Ke, Takeo Kanade
JSCIC
2010
101views more  JSCIC 2010»
14 years 6 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
NETWORKING
2000
15 years 15 days ago
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offere...
Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto