Sciweavers

6045 search results - page 309 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DATE
2002
IEEE
79views Hardware» more  DATE 2002»
16 years 11 days ago
Formulation of Low-Order Dominant Poles for Y-Matrix of Interconnects
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
Qinwei Xu, Pinaki Mazumder
AGP
1999
IEEE
15 years 11 months ago
Enhancing Sharing for Precision
Regarding the precision of combined domains including Jacobs and Langen's Sharing there is a core of techniques, such as the standard integration with freeness and linearity ...
Roberto Bagnara, Enea Zaffanella, Patricia M. Hill
SAC
2008
ACM
15 years 6 months ago
Improving denial of service resistance using dynamic local adaptations
We improve the resistance of gossip-based multicast to (Distributed) Denial of Service (DoS) attacks using dynamic local adaptations at each node. Each node estimates the current ...
Gal Badishi, Idit Keidar
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 4 months ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
ICCV
2011
IEEE
14 years 7 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez