Sciweavers

1640 search results - page 298 / 328
» Conditional Independence Trees
Sort
View
PPOPP
1997
ACM
14 years 24 days ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
USITS
2003
13 years 10 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
BMCBI
2007
156views more  BMCBI 2007»
13 years 8 months ago
Large-scale clustering of CAGE tag expression data
Background: Recent analyses have suggested that many genes possess multiple transcription start sites (TSSs) that are differentially utilized in different tissues and cell lines. ...
Kazuro Shimokawa, Yuko Okamura-Oho, Takio Kurita, ...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 8 months ago
To Feed or Not to Feed Back
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
DC
2010
13 years 8 months ago
A knowledge-based analysis of global function computation
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
Joseph Y. Halpern, Sabina Petride