Sciweavers

272 search results - page 54 / 55
» Lazy tree splitting
Sort
View
CIKM
2006
Springer
13 years 10 months ago
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis
BMCBI
2010
227views more  BMCBI 2010»
13 years 6 months ago
Accurate and efficient gp120 V3 loop structure based models for the determination of HIV-1 co-receptor usage
Background: HIV-1 targets human cells expressing both the CD4 receptor, which binds the viral envelope glycoprotein gp120, as well as either the CCR5 (R5) or CXCR4 (X4) co-recepto...
Majid Masso, Iosif I. Vaisman
BMCBI
2008
107views more  BMCBI 2008»
13 years 6 months ago
Extended Newick: it is time for a standard representation of phylogenetic networks
Background: Phylogenetic trees resulting from molecular phylogenetic analysis are available in Newick format from specialized databases but when it comes to phylogenetic networks,...
Gabriel Cardona, Francesc Rosselló, Gabriel...
COR
2006
97views more  COR 2006»
13 years 6 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 6 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...