Sciweavers

207 search results - page 14 / 42
» Convexity of the Proximal Average
Sort
View
NIPS
2007
13 years 9 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 2 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
JOTA
2010
117views more  JOTA 2010»
13 years 6 months ago
Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization
We consider a distributed multi-agent network system where the goal is to minimize a sum of agent objective functions subject to a common set of constraints. For this problem, we p...
S. Sundhar Ram, Angelia Nedic, Venugopal V. Veerav...
ICASSP
2009
IEEE
14 years 2 months ago
Statistical analysis of amplitude modulation in speech signals using an AM-FM model
Several studies have been dedicated to the analysis and modeling of AM–FM modulations in speech and different algorithms have been proposed for the exploitation of modulations i...
Pirros Tsiakoulis, Alexandros Potamianos
TREC
2004
13 years 8 months ago
Using Clustering and Blade Clusters in the Terabyte Task
Web search engines exploit conjunctive queries and special ranking criteria which differ from the disjunctive queries typically used for ad-hoc retrieval. We wanted to asses the e...
Giuseppe Attardi, Andrea Esuli, Chirag Patel