1802 search results - page 237 / 361 » Sparse Computations with PEI |
127
click to vote
CVPR
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a Bayesian framework for content-based image retrieval which models the distribution of color and texture features within sets of related images. Given a userspecified ...
129
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
126
click to vote
CIA
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we propose a probabilistic framework targeting three important issues in the computation of quality and trust in decentralized systems. Specifically, our approach a...
112
Voted
ICPPW
2006
IEEE
15 years 7 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
109
Voted
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...