Sciweavers

1092 search results - page 147 / 219
» Convex Methods for Transduction
Sort
View
ACML
2009
Springer
15 years 1 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
ASPDAC
2007
ACM
96views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Hierarchical Optimization Methodology for Wideband Low Noise Amplifiers
In this paper, we present a systematic synthesis methodology for fully integrated wideband low noise amplifiers that simultaneously optimizes impedance matching, noise figure, and ...
Arthur Nieuwoudt, Tamer Ragheb, Yehia Massoud
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
15 years 1 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
ICCAD
1995
IEEE
95views Hardware» more  ICCAD 1995»
15 years 1 months ago
A sequential quadratic programming approach to concurrent gate and wire sizing
With an ever-increasing portion of the delay in highspeed CMOS chips attributable to the interconnect, interconnect-circuit design automation continues to grow in importance. By t...
Noel Menezes, Ross Baldick, Lawrence T. Pileggi
DAGM
2008
Springer
14 years 11 months ago
Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
Filip Korc, Wolfgang Förstner