Sciweavers

3946 search results - page 218 / 790
» The computational complexity of choice sets
Sort
View
202
Voted
HASE
1997
IEEE
15 years 11 months ago
Automated Computation of Decomposable Synchronization Conditions
: The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchroniz...
Gilberto Matos, James M. Purtilo, Elizabeth L. Whi...
CGF
2008
201views more  CGF 2008»
15 years 6 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt
BMCBI
2005
122views more  BMCBI 2005»
15 years 6 months ago
Computational verification of protein-protein interactions by orthologous co-expression
Background: High-throughput methods identify an overwhelming number of protein-protein interactions. However, the limited accuracy of these methods results in the false identifica...
Itay Tirosh, Naama Barkai
227
Voted
FOCS
2000
IEEE
15 years 11 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
BMCBI
2010
106views more  BMCBI 2010»
15 years 6 months ago
A computational evaluation of over-representation of regulatory motifs in the promoter regions of differentially expressed genes
Background: Observed co-expression of a group of genes is frequently attributed to co-regulation by shared transcription factors. This assumption has led to the hypothesis that pr...
Guofeng Meng, Axel Mosig, Martin Vingron