Sciweavers

2899 search results - page 211 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
CEC
2010
IEEE
15 years 7 months ago
Constrained global optimization of low-thrust interplanetary trajectories
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
Chit Hong Yam, David Di Lorenzo, Dario Izzo
ICCAD
1999
IEEE
88views Hardware» more  ICCAD 1999»
15 years 11 months ago
Performance optimization under rise and fall parameters
Typically,cell parameterssuch as the pin-to-pinintrinsicdelays, load-dependentcoe cients,andinputpin capacitanceshavedifferent values for rising and falling signals. The performan...
Rajeev Murgai
PODC
2004
ACM
16 years 1 days ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
FGR
2011
IEEE
227views Biometrics» more  FGR 2011»
14 years 10 months ago
Warp that smile on your face: Optimal and smooth deformations for face recognition
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
Tobias Gass, Leonid Pishchulin, Philippe Dreuw, He...
TIT
2010
154views Education» more  TIT 2010»
15 years 1 months ago
A universal scheme for Wyner-Ziv coding of discrete sources
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
Shirin Jalali, Sergio Verdú, Tsachy Weissma...