5592 search results - page 177 / 1119 » On Random Betweenness Constraints |
134
click to vote
SIGMOD
1999
ACM
15 years 9 months ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...
143
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
164
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
151
click to vote
TIT
2010
14 years 12 months ago
2010
Totally asynchronous code-division multiple-access (CDMA) systems are addressed. In part I, the fundamental limits of asynchronous CDMA systems were analyzed in terms of total cap...
144
click to vote
TSP
2010
14 years 11 months ago
2010
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...