Sciweavers

405 search results - page 68 / 81
» On the Simulation of Tikhonov Random Processes
Sort
View
ISTCS
1992
Springer
15 years 1 months ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit
BMCBI
2008
155views more  BMCBI 2008»
14 years 10 months ago
Extending pathways based on gene lists using InterPro domain signatures
Background: High-throughput technologies like functional screens and gene expression analysis produce extended lists of candidate genes. Gene-Set Enrichment Analysis is a commonly...
Florian Hahne, Alexander Mehrle, Dorit Arlt, Annem...
BMCBI
2006
84views more  BMCBI 2006»
14 years 9 months ago
Inferring topology from clustering coefficients in protein-protein interaction networks
Background: Although protein-protein interaction networks determined with high-throughput methods are incomplete, they are commonly used to infer the topology of the complete inte...
Caroline C. Friedel, Ralf Zimmer
QRE
2008
140views more  QRE 2008»
14 years 9 months ago
Discrete mixtures of kernels for Kriging-based optimization
: Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set....
David Ginsbourger, Céline Helbert, Laurent ...
P2P
2007
IEEE
153views Communications» more  P2P 2007»
15 years 4 months ago
On Routing in Distributed Hash Tables
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...