Sciweavers

224 search results - page 5 / 45
» Auctions with Severely Bounded Communication
Sort
View
INFOCOM
2002
IEEE
14 years 8 days ago
Bounding the Lifetime of Sensor Networks Via Optimal Role Assignments
— A key challenge in ad-hoc, data-gathering wireless sensor networks is achieving a lifetime of several years using nodes that carry merely hundreds of joules of stored energy. I...
Manish Bhardwaj, Anantha Chandrakasan
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
13 years 11 months ago
Smaller Two-Qubit Circuits for Quantum Communication and Computation
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
Vivek V. Shende, Igor L. Markov, Stephen S. Bulloc...
MA
2010
Springer
168views Communications» more  MA 2010»
13 years 5 months ago
Bounds for the sum of dependent risks having overlapping marginals
We describe several analytical and numerical procedures to obtain bounds on the distribution function of a sum of n dependent risks having fixed overlapping marginals. As an appl...
Paul Embrechts, Giovanni Puccetti
ICC
2007
IEEE
14 years 1 months ago
New Bounds on the Aperiodic Total Squared Correlation of Binary Signature Sets and Optimal Designs
— We derive new bounds on the aperiodic total squared correlation (ATSC) of binary antipodal signature sets for any number of signatures K and any signature length L. We then pre...
Harish Ganapathy, Dimitrios A. Pados, George N. Ka...
TCS
1998
13 years 7 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran