Sciweavers

569 search results - page 110 / 114
» Online Bounds for Bayesian Algorithms
Sort
View
SIAMCO
2010
97views more  SIAMCO 2010»
14 years 4 months ago
Real-Time Nonlinear Optimization as a Generalized Equation
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
Victor M. Zavala, Mihai Anitescu
ICCV
2011
IEEE
13 years 9 months ago
Strong Supervision From Weak Annotation: Interactive Training of Deformable Part Models
We propose a framework for large scale learning and annotation of structured models. The system interleaves interactive labeling (where the current model is used to semiautomate t...
Steven Branson, Pietro Perona, Serge Belongie
SPAA
2004
ACM
15 years 3 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
15 years 10 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICA
2010
Springer
14 years 10 months ago
Probabilistic Latent Tensor Factorization
We develop a probabilistic modeling framework for multiway arrays. Our framework exploits the link between graphical models and tensor factorization models and it can realize any ...
Y. Kenan Yilmaz, A. Taylan Cemgil