1055 search results - page 80 / 211 » Convex Factorization Machines |
191
Voted
CORR
2010
Springer
15 years 7 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...
152
click to vote
NA
2006
15 years 7 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...
156
Voted
DAM
1999
15 years 7 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...
193
Voted
EMNLP
2010
15 years 5 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...
204
click to vote
JMLR
2010
15 years 2 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...