Sciweavers

298 search results - page 54 / 60
» Competitive Analysis of Flash-Memory Algorithms
Sort
View
JCB
2006
124views more  JCB 2006»
14 years 9 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
BMCBI
2011
14 years 4 months ago
RAIphy: Phylogenetic classification of metagenomics samples using iterative refinement of relative abundance index profiles
Background: Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diver...
Ozkan U. Nalbantoglu, Samuel F. Way, Steven H. Hin...
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 1 months ago
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...
Stefan Edelkamp
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
CIKM
2006
Springer
15 years 1 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...