234 search results - page 21 / 47 » Isolation, Matching, and Counting |
135
click to vote
EUSFLAT
2001
15 years 5 months ago
2001
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...
128
click to vote
JCO
2006
15 years 4 months ago
2006
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...
201
click to vote
TCS
2008
15 years 3 months ago
2008
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...
123
click to vote
CCE
2005
15 years 3 months ago
2005
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...
142
click to vote
EUROSYS
2009
ACM
16 years 1 months ago
2009
ACM
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...