Sciweavers

1136 search results - page 178 / 228
» Finding Small Holes
Sort
View
CCR
2010
202views more  CCR 2010»
13 years 8 months ago
Understanding data center traffic characteristics
As data centers become more and more central in Internet communications, both research and operations communities have begun to explore how to better design and manage them. In th...
Theophilus Benson, Ashok Anand, Aditya Akella, Min...
ADHOC
2006
155views more  ADHOC 2006»
13 years 8 months ago
Application versus network layer multicasting in ad hoc networks: the ALMA routing protocol
Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer mu...
Min Ge, Srikanth V. Krishnamurthy, Michalis Falout...
BMCBI
2006
148views more  BMCBI 2006»
13 years 8 months ago
Exploiting the full power of temporal gene expression profiling through a new statistical test: Application to the analysis of m
Background: The identification of biologically interesting genes in a temporal expression profiling dataset is challenging and complicated by high levels of experimental noise. Mo...
Veronica Vinciotti, Xiaohui Liu, Rolf Turk, Emile ...
BMCBI
2006
100views more  BMCBI 2006»
13 years 8 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
BMCBI
2006
141views more  BMCBI 2006»
13 years 8 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...