Sciweavers

425 search results - page 38 / 85
» Polynomial Factorization 1987-1991
Sort
View
UAI
2000
14 years 7 days ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 6 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
ICCV
2011
IEEE
12 years 11 months ago
A Theory of Coprime Blurred Pairs
We present a new Coprime Blurred Pair (CBP) theory that may benefit a number of computer vision applications. A CBP is constructed by blurring the same latent image with two unkn...
Feng Li, Zijia Li, David Saunders, Jingyi Yu
FOCS
2007
IEEE
14 years 5 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
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 11 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...