1055 search results - page 80 / 211 » Convex Factorization Machines |
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
105
click to vote
NA
2006
15 years 4 months ago
2006
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
113
click to vote
DAM
1999
15 years 4 months ago
1999
An ordered partition of a set of n points in the d dimensional Euclidean space is called a separable partition if the convex hulls of the parts are pairwise disjoint. For each fix...
136
click to vote
EMNLP
2010
15 years 2 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
124
click to vote
JMLR
2010
14 years 11 months ago
2010
While most popular collaborative filtering methods use low-rank matrix factorization and parametric density assumptions, this article proposes an approach based on distribution-fr...