Sciweavers

824 search results - page 108 / 165
» Weighted Low-Rank Approximations
Sort
View
NETWORKS
2010
14 years 8 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
14 years 4 months ago
Consensus-based distributed linear filtering
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
Ion Matei, John S. Baras
INTERSPEECH
2010
14 years 4 months ago
Boosted mixture learning of Gaussian mixture HMMs for speech recognition
In this paper, we propose a novel boosted mixture learning (BML) framework for Gaussian mixture HMMs in speech recognition. BML is an incremental method to learn mixture models fo...
Jun Du, Yu Hu, Hui Jiang
EMNLP
2011
13 years 9 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 4 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...