Sciweavers

5793 search results - page 1080 / 1159
» Individual communication complexity
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 3 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
BMCBI
2006
45views more  BMCBI 2006»
15 years 3 months ago
A simple spreadsheet-based, MIAME-supportive format for microarray data: MAGE-TAB
Background: Sharing of microarray data within the research community has been greatly facilitated by the development of the disclosure and communication standards MIAME and MAGEML...
Tim F. Rayner, Philippe Rocca-Serra, Paul T. Spell...
CGF
2007
156views more  CGF 2007»
15 years 3 months ago
Automatic Light Source Placement for Maximum Visual Information Recovery
The automatic selection of good viewing parameters is a very complex problem. In most cases, the notion of good strongly depends on the concrete application. Moreover, when an int...
Pere-Pau Vázquez
IJPP
2006
145views more  IJPP 2006»
15 years 3 months ago
Deterministic Parallel Processing
Abstract. In order to address the problems faced in the wireless communications domain, picoChip has devised the picoArrayTM . The picoArrayTM is a tiled-processor architecture, co...
Gajinder Panesar, Daniel Towner, Andrew Duller, Al...
JOC
2008
86views more  JOC 2008»
15 years 3 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
« Prev « First page 1080 / 1159 Last » Next »