1510 search results - page 97 / 302 » Upper Probabilities and Additivity |
105
click to vote
INFOCOM
2012
IEEE
13 years 10 days ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
CLEF
2010
Springer
14 years 11 months ago
2010
Springer
Our submission this year is generated by the same method Encoplot that we have developed for the last year competition. There is a single improvement, we compare in addition each s...
115
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph cuts have proven to be powerful tools in image segmentation. Previous graph cut research has proposed methods for cutting across large graphs constructed from multiple layer...
UC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We investigate methods for exploiting nondeterminism inherent within the Tile Assembly Model in order to generate uniform random numbers. Namely, given an integer range {...
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Consider the problem of base-station and subcarrier assignment on the downlink of a two-cell OFDMA system with adaptive modulation. The aim is to maximize a common data...