240 search results - page 25 / 48 » Constrained Partial Deduction |
ORL
2011
13 years 3 months ago
2011
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. ...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, ma...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
ADG
2006
Springer
14 years 2 months ago
2006
Springer
It is known that five points in 3 generically determine a finite number of cylinders containing those points. We discuss ways in which it can be shown that the generic (complex) nu...