Sciweavers

719 search results - page 61 / 144
» Solving Sparse Linear Constraints
Sort
View
ATAL
2007
Springer
15 years 5 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker
CVPR
2010
IEEE
15 years 7 months ago
Fast Matting Using Large Kernel Matting Laplacian Matrices
Image matting is of great importance in both computer vision and graphics applications. Most existing state-of-the-art techniques rely on large sparse matrices such as the matting ...
Kaiming He, Jian Sun, Xiaoou Tang
UAI
2004
15 years 6 days ago
Maximum Entropy for Collaborative Filtering
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
C. Lawrence Zitnick, Takeo Kanade
JACM
2010
116views more  JACM 2010»
14 years 9 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
CISS
2008
IEEE
15 years 5 months ago
Improved sum-rate optimization in the multiuser MIMO downlink
—We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multiple-output (MIMO) system. In this scenario, the transmitter and the receivers may e...
Adam J. Tenenbaum, Raviraj S. Adve