Sciweavers

1396 search results - page 109 / 280
» Succinct Dynamic Data Structures
Sort
View
JACM
2007
132views more  JACM 2007»
15 years 1 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
CCCG
2008
15 years 2 months ago
Core-Preserving Algorithms
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
Hamid Zarrabi-Zadeh
BMCBI
2007
227views more  BMCBI 2007»
15 years 1 months ago
Growing functional modules from a seed protein via integration of protein interaction and gene expression data
Background: Nowadays modern biology aims at unravelling the strands of complex biological structures such as the protein-protein interaction (PPI) networks. A key concept in the o...
Ioannis A. Maraziotis, Konstantina Dimitrakopoulou...
INFOCOM
2009
IEEE
15 years 8 months ago
FiConn: Using Backup Port for Server Interconnection in Data Centers
Abstract— The goal of data center networking is to interconnect a large number of server machines with low equipment cost, high and balanced network capacity, and robustness to l...
Dan Li, Chuanxiong Guo, Haitao Wu, Kun Tan, Songwu...
IPPS
1998
IEEE
15 years 5 months ago
Memory Space Representation for Heterogeneous Network Process Migration
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
Kasidit Chanchio, Xian-He Sun