Sciweavers

4934 search results - page 406 / 987
» complexity 2008
Sort
View
CN
2008
117views more  CN 2008»
15 years 7 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
SIROCCO
2008
15 years 9 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
193
Voted
ALMOB
2008
95views more  ALMOB 2008»
15 years 7 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
BMCBI
2008
163views more  BMCBI 2008»
15 years 7 months ago
Nuclear staining and relative distance for quantifying epidermal differentiation in biomarker expression profiling
Background: The epidermal physiology results from a complex regulated homeostasis of keratinocyte proliferation, differentiation and death and is tightly regulated by a specific p...
Thora Pommerencke, Thorsten Steinberg, Hartmut Dic...
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 7 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim