CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Vite...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--The L-user additive white Gaussian noise multiway relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing...
AOR
2007
13 years 4 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
SIGCOMM
2010
ACM
13 years 4 months ago
2010
ACM
We introduce and motivate crowd computing, which combines mobile devices and social interactions to achieve large-scale distributed computation. An opportunistic network of mobile...
CCCG
2009
13 years 5 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
AAAI
1996
13 years 5 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...