3145 search results - page 165 / 629 » Algebraic Linear Orderings |
125
click to vote
CC
2007
Springer
15 years 4 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
175
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
107
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...
122
Voted
CVPR
2010
IEEE
16 years 21 days ago
2010
IEEE
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, we propose an optimal metric for detection ordering in terms of symbol error rate (SER) in vertical Bell-lab Layered Space-Time (V-BLAST) systems. Motivated by t...