11345 search results - page 1996 / 2269 » Foundations of Computer Science |
157
Voted
FROCOS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
139
click to vote
GECCO
2007
Springer
15 years 9 months 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....
121
Voted
GECCO
2007
Springer
15 years 9 months 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 ...
127
click to vote
ICALP
2007
Springer
15 years 9 months 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...
121
Voted
ICALP
2007
Springer
15 years 9 months 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 ...