Sciweavers

7811 search results - page 1385 / 1563
» computing 2004
Sort
View
138
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 3 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
138
Voted
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
15 years 9 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
NIPS
2004
15 years 4 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
134
Voted
PDPTA
2004
15 years 4 months ago
On the Use of NSGrid for Accurate Grid Schedule Evaluation
Abstract Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly comp...
Bruno Volckaert, Pieter Thysebaert, Marc De Leenhe...
150
Voted
BMCBI
2004
208views more  BMCBI 2004»
15 years 3 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
« Prev « First page 1385 / 1563 Last » Next »