Sciweavers

529 search results - page 34 / 106
» The Optimal Fixed Point Combinator
Sort
View
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
15 years 1 months ago
Quantifying robustness metrics in parameterized static timing analysis
Process and environmental variations continue to present significant challenges to designers of high-performance integrated circuits. In the past few years, while much research has...
Khaled R. Heloue, Chandramouli V. Kashyap, Farid N...
ICVGIP
2004
15 years 5 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
AAAI
2010
15 years 5 months ago
Smooth Optimization for Effective Multiple Kernel Learning
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
Zenglin Xu, Rong Jin, Shenghuo Zhu, Michael R. Lyu...
JOTA
2011
149views more  JOTA 2011»
14 years 10 months ago
Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
Napsu Karmitsa, Mario Tanaka Filho, José He...
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 3 months ago
Coordination and Bargaining over the Gaussian Interference Channel
This work considers coordination and bargaining between two selfish users over a Gaussian interference channel using game theory. The usual information theoretic approach assumes f...
Xi Liu, Elza Erkip