11016 search results - page 1896 / 2204 » Cloud Computing for Science |
175
Voted
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
157
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
In this paper, we describe an experiment to evolve oral tract (mouth) shapes for a set of vowels for two adult males. Target vowels were recorded in an acoustically anechoic room ...
180
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
178
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
172
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...