137
click to vote
TCS
2011
14 years 10 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
139
click to vote
TCS
2011
14 years 10 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...
TCS
2011
14 years 10 months ago
2011
132
click to vote
TCS
2011
14 years 10 months ago
2011
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
TCS
2011
14 years 10 months ago
2011
TCS
2011
14 years 10 months ago
2011
137
click to vote
TCS
2011
14 years 10 months ago
2011
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
150
click to vote
TCS
2011
14 years 10 months ago
2011
An active learner has a collection of data points, each with a label that is initially hidden but can be obtained at some cost. Without spending too much, it wishes to find a cla...
146
click to vote
TCS
2011
14 years 10 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...