Sciweavers

1118 search results - page 59 / 224
» Convex Optimization
Sort
View
COMGEO
2010
ACM
15 years 4 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
ANOR
2002
47views more  ANOR 2002»
15 years 4 months ago
Nonparametric Adverse Selection Problems
This article is devoted to adverse selection problems in which individual private information is a whole utility function and cannot be reduced to some finite-dimensional parameter...
Guillaume Carlier
CVPR
2010
IEEE
16 years 4 days ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
164
Voted
CORR
2012
Springer
214views Education» more  CORR 2012»
14 years 7 days ago
Stochastic Low-Rank Kernel Learning for Regression
We present a novel approach to learn a kernelbased regression function. It is based on the use of conical combinations of data-based parameterized kernels and on a new stochastic ...
Pierre Machart, Thomas Peel, Liva Ralaivola, Sandr...
OL
2011
177views Neural Networks» more  OL 2011»
14 years 7 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann