Sciweavers

3643 search results - page 421 / 729
» Learning Submodular Functions
Sort
View
COLING
2008
15 years 8 months ago
Rank Distance as a Stylistic Similarity
In this paper we propose a new distance function (rank distance) designed to reflect stylistic similarity between texts. To assess the ability of this distance measure to capture ...
Marius Popescu, Liviu Petrisor Dinu
ESANN
2006
15 years 8 months ago
Independent dynamics subspace analysis
Abstract. The paper presents an algorithm for identifying the independent subspace analysis model based on source dynamics. We propose to separate subspaces by decoupling their dyn...
Alexander Ilin
IJCAI
2003
15 years 8 months ago
Constructing utility models from observed negotiation actions
We propose a novel method for constructing utility models by learning from observed negotiation actions. In particular, we show how offers and counter-offers in negotiation can be...
Angelo C. Restificar, Peter Haddawy
UAI
2003
15 years 8 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 6 months ago
An optimization problem on the sphere
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
Andreas Maurer