1510 search results - page 166 / 302 » Upper Probabilities and Additivity |
136
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
101
click to vote
JOCN
2010
15 years 2 months ago
2010
■ It is still debated to what degree top–down and bottom–up driven attentional control processes are subserved by shared or by separate mechanisms. Interactions between thes...
123
Voted
TIFS
2010
15 years 2 months ago
2010
—As the use of digital images has increased, so has the means and the incentive to create digital image forgeries. Accordingly, there is a great need for digital image forensic t...
130
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
124
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...