Sciweavers

1390 search results - page 58 / 278
» Coordination Patterns for Parallel Computing
Sort
View
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 1 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
COREGRID
2007
Springer
14 years 1 months ago
Co-Allocating Compute and Network Resources
Distributed applications or workflows need to access and use compute, storage and network resources simultaneously or chronologically coordinated respectively. Examples are distri...
Thomas Eickermann, Lidia Westphal, Oliver Wäl...
BMCBI
2004
208views more  BMCBI 2004»
13 years 7 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
EMMCVPR
2009
Springer
14 years 2 months ago
Locally Parallel Textures Modeling with Adapted Hilbert Spaces
This article 3 presents a new adaptive texture model. Locally parallel oscillating patterns are modeled with a weighted Hilbert space defined over local Fourier coefficients. The ...
Pierre Maurel, Jean-François Aujol, Gabriel...
JSSPP
2000
Springer
13 years 11 months ago
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
Fabrizio Petrini, Wu-chun Feng