The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
—We propose a new adaptive admission control scheme for multiuser OFDMA systems to allocate wireless resource with low complexity. In this adaptive admission control scheme, the ...
Kyung-Ho Sohn, Jongkyung Kim, Tae Sung Kim, Young ...
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...