5592 search results - page 275 / 1119 » On Random Betweenness Constraints |
213
click to vote
IJCV
2008
15 years 6 months ago
2008
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model f...
190
click to vote
TCS
2012
14 years 2 months ago
2012
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
164
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
171
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The problem of maximizing the average rate in a multicast network subject to a coverage constraint (minimum quality of service) is studied. Assuming the channel state information ...