Sciweavers

1243 search results - page 117 / 249
» Complexity reduction of C-Algorithm
Sort
View
CSUR
2000
78views more  CSUR 2000»
15 years 1 months ago
Developing flexible and high-performance Web servers with frameworks and patterns
The goal of this paper is to illustrate how frameworks and patterns address complexities that arise in the design and implementation of high-performance distributed software syste...
Douglas C. Schmidt, James C. Hu
MICRO
2008
IEEE
131views Hardware» more  MICRO 2008»
15 years 7 months ago
Token flow control
As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scala...
Amit Kumar 0002, Li-Shiuan Peh, Niraj K. Jha
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
15 years 7 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
NIPS
2007
15 years 2 months ago
Locality and low-dimensions in the prediction of natural experience from fMRI
Functional Magnetic Resonance Imaging (fMRI) provides dynamical access into the complex functioning of the human brain, detailing the hemodynamic activity of thousands of voxels d...
Francois Meyer, Greg Stephens
BMCBI
2007
136views more  BMCBI 2007»
15 years 1 months ago
Reduced modeling of signal transduction - a modular approach
Background: Combinatorial complexity is a challenging problem in detailed and mechanistic mathematical modeling of signal transduction. This subject has been discussed intensively...
Markus Koschorreck, Holger Conzelmann, Sybille Ebe...