5592 search results - page 498 / 1119 » On Random Betweenness Constraints |
191
click to vote
TCOM
2010
15 years 1 months ago
2010
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
216
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
197
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
229
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
188
click to vote
CISS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—We consider the transmission completion time minimization problem in a single-user energy harvesting wireless communication system. In this system, both the data packets...