Sciweavers

4198 search results - page 67 / 840
» In search of lost time
Sort
View
IPL
2002
119views more  IPL 2002»
15 years 5 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
ICDCSW
2003
IEEE
15 years 11 months ago
CATP: A Context-Aware Transportation Protocol for HTTP
— The rendering mechanism used in Web browsers have a significant impact on the user behavior and delay tolerance of retrieval. The head-of-line blocking phenomena prevents the ...
Huamin Chen, Prasant Mohapatra
BMCBI
2006
117views more  BMCBI 2006»
15 years 5 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
253
Voted
RECOMB
2012
Springer
13 years 8 months ago
A Model for Biased Fractionation after Whole Genome Duplication
Background: Paralog reduction, the loss of duplicate genes after whole genome duplication (WGD) is a pervasive process. Whether this loss proceeds gene by gene or through deletion...
David Sankoff, Chunfang Zheng, Baoyong Wang
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
15 years 11 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin