10935 search results - page 2007 / 2187 » Neural Programming Language |
111
click to vote
ICALP
2007
Springer
15 years 7 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...
122
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
104
click to vote
ICALP
2007
Springer
15 years 7 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 ...
102
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
131
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...