Sciweavers

653 search results - page 112 / 131
» The size of minimum 3-trees
Sort
View
127
Voted
CN
2002
102views more  CN 2002»
15 years 1 months ago
Predicting bottleneck bandwidth sharing by generalized TCP flows
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottlene...
Archan Misra, Teunis J. Ott, John S. Baras
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 2 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
RECOMB
2006
Springer
16 years 2 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
FSTTCS
2009
Springer
15 years 8 months ago
Kernels for Feedback Arc Set In Tournaments
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...
107
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 7 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza