Sciweavers

791 search results - page 59 / 159
» Approximating the Maximum Sharing Problem
Sort
View
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 2 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
14 years 2 months ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
CN
2007
88views more  CN 2007»
13 years 7 months ago
Channel sharing by multi-class rate adaptive streams: Performance region and optimization
We consider the problem of channel sharing by rate adaptive streams belonging to various classes. The performance measure per class is the average scaled bandwidth allocated to co...
Nikos Argiriou, Leonidas Georgiadis
TSMC
2008
136views more  TSMC 2008»
13 years 7 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
CP
2006
Springer
13 years 11 months ago
Inner and Outer Approximations of Existentially Quantified Equality Constraints
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
Alexandre Goldsztejn, Luc Jaulin