Sciweavers

7106 search results - page 1113 / 1422
» Restricted Complexity, General Complexity
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 6 months ago
A Variational Inference Framework for Soft-In-Soft-Out Detection in Multiple Access Channels
We propose a unified framework for deriving and studying soft-in soft-out (SISO) detection in multiple-access channels using the concept of variational inference. The proposed fram...
Darryl Dexu Lin, Teng Joon Lim
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Polynomial Linear Programming with Gaussian Belief Propagation
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
Danny Bickson, Yoav Tock, Ori Shental, Danny Dolev
CVIU
2010
89views more  CVIU 2010»
15 years 6 months ago
Spherical approximation for multiple cameras in motion estimation: Its applicability and advantages
Estimating motions of a multi-camera system which may not have overlapping fields of view is generally complex and computationally expensive because of the non-zero offset between...
Jun-Sik Kim, Myung Hwangbo, Takeo Kanade
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
« Prev « First page 1113 / 1422 Last » Next »