Sciweavers

350 search results - page 3 / 70
» Lower and upper bounds on obtaining history independence
Sort
View
TIT
2010
107views Education» more  TIT 2010»
13 years 1 months ago
Information inequalities for joint distributions, with interpretations and applications
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
Mokshay M. Madiman, Prasad Tetali
JCT
2007
146views more  JCT 2007»
13 years 7 months ago
Laplacian spectral bounds for clique and independence numbers of graphs
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
Mei Lu, Huiqing Liu, Feng Tian
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 5 months ago
A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to...
Ali Nazari, S. Sandeep Pradhan, Achilleas Anastaso...
TPDS
1998
95views more  TPDS 1998»
13 years 6 months ago
Bound Performance Models of Heterogeneous Parallel Processing Systems
- Systems of heterogeneous parallel processing are studied such as arising in parallel programs executed on distributed systems. A lower and an upper bound model are suggested to o...
Simonetta Balsamo, Lorenzo Donatiello, Nico M. van...
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 7 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor