Sciweavers

5864 search results - page 265 / 1173
» Can We Work around Numerical Methods
Sort
View
DAGM
2008
Springer
15 years 8 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
ATAL
2010
Springer
15 years 6 months ago
A probabilistic model for trust and reputation
This paper concerns the problem of agent trust in an electronic market place. We maintain that agent trust involves making decisions under uncertainty and therefore the phenomenon...
George Vogiatzis, Ian MacGillivray, Maria Chli
AAAI
2012
13 years 8 months ago
Transfer Learning in Collaborative Filtering with Uncertain Ratings
To solve the sparsity problem in collaborative filtering, researchers have introduced transfer learning as a viable approach to make use of auxiliary data. Most previous transfer...
Weike Pan, Evan Wei Xiang, Qiang Yang
CVPR
2008
IEEE
16 years 8 months ago
On controlling light transport in poor visibility environments
Poor visibility conditions due to murky water, bad weather, dust and smoke severely impede the performance of vision systems. Passive methods have been used to restore scene contr...
Mohit Gupta, Srinivasa G. Narasimhan, Yoav Y. Sche...
AMC
2005
138views more  AMC 2005»
15 years 6 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa