Sciweavers

563 search results - page 58 / 113
» Computing approximate PSD factorizations
Sort
View
ICCV
2011
IEEE
12 years 10 months ago
Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion
The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
Gunhee Kim, Eric P. Xing, Li Fei-Fei, Takeo Kanade
FOCS
2007
IEEE
14 years 4 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
JAIR
2008
113views more  JAIR 2008»
13 years 10 months ago
Graphical Model Inference in Optimal Control of Stochastic Multi-Agent Systems
In this article we consider the issue of optimal control in collaborative multi-agent systems with stochastic dynamics. The agents have a joint task in which they have to reach a ...
Bart van den Broek, Wim Wiegerinck, Bert Kappen
PAMI
2008
145views more  PAMI 2008»
13 years 10 months ago
Latent-Space Variational Bayes
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has ...
JaeMo Sung, Zoubin Ghahramani, Sung Yang Bang
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...