Sciweavers

2746 search results - page 88 / 550
» Bisubmodular Function Minimization
Sort
View
214
Voted
ORL
2011
14 years 10 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
ICASSP
2011
IEEE
14 years 7 months ago
From direction of arrival estimates to localization of planar reflectors in a two dimensional geometry
In this paper we propose a novel technique to localize planar obstacles through the measurement of the Direction of Arrival by a microphone array. The measurement of the Direction...
Antonio Canclini, Paolo Annibale, Fabio Antonacci,...
WCE
2007
15 years 4 months ago
Cost Effective Implementation of Asynchronous Two-Level Logic
- We proposed the cost effective (in sense of gate number) asynchronous two-level logic. It is based on AND-OR implementation of minimized logic functions. We formulated and proved...
Igor Lemberski
DSD
2004
IEEE
126views Hardware» more  DSD 2004»
15 years 7 months ago
Boolean Minimizer FC-Min: Coverage Finding Process
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
Petr Fiser, Hana Kubatova
74
Voted
CORR
2010
Springer
53views Education» more  CORR 2010»
15 years 3 months ago
Parametric polynomial minimal surfaces of arbitrary degree
Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass represe...
Gang Xu, Guozhao Wang