2168 search results - page 135 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
167
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
136
click to vote
ICCV
2009
IEEE
16 years 7 months ago
2009
IEEE
Through radiometric compensation, a projector-camera system can project a desired image onto a non-flat and nonwhite surface. This can be achieved by computing the inverse light tr...
150
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
152
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
169
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
The bag-of-words (BoW) model treats images as an unordered set of local regions and represents them by visual word histograms. Implicitly, regions are assumed to be identically an...