Sciweavers

234 search results - page 21 / 47
» Isolation, Matching, and Counting
Sort
View
EUSFLAT
2001
15 years 1 months ago
Similarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
Hans De Meyer, Bernard De Baets, Saskia Janssens
JCO
2006
126views more  JCO 2006»
14 years 11 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
TCS
2008
14 years 11 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
CCE
2005
14 years 11 months ago
New rigorous one-step MILP formulation for heat exchanger network synthesis
In this paper, a rigorous MILP formulation for grass-root design of heat exchanger networks is developed. The methodology does not rely on traditional supertargeting followed by n...
Andrés F. Barbaro, Miguel J. Bagajewicz
EUROSYS
2009
ACM
15 years 9 months ago
Predicting replicated database scalability from standalone database profiling
This paper develops analytical models to predict the throughput and the response time of a replicated database using measurements of the workload on a standalone database. These m...
Sameh Elnikety, Steven G. Dropsho, Emmanuel Cecche...