Sciweavers

1529 search results - page 269 / 306
» A slant removal algorithm
Sort
View
DAM
2010
112views more  DAM 2010»
13 years 8 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
BMCBI
2007
86views more  BMCBI 2007»
13 years 8 months ago
Tandem mass spectrometry data quality assessment by self-convolution
Background: Many algorithms have been developed for deciphering the tandem mass spectrometry (MS) data sets. They can be essentially clustered into two classes. The first performs...
Keng Wah Choo, Wai Mun Tham
CN
2007
141views more  CN 2007»
13 years 8 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
SCN
2008
Springer
136views Communications» more  SCN 2008»
13 years 8 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 8 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...