13603 search results - page 74 / 2721 » On the Computational Complexity of Cut-Reduction |
193
click to vote
ORDER
2010
15 years 4 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
167
click to vote
TCS
2011
15 years 24 days 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 ...
161
click to vote
CSE
2009
IEEE
15 years 9 months ago
2009
IEEE
An important aspect in social computing is the structure of social networks, which build the underlying substrate for the exchange of information. With the growing importance of mi...
153
click to vote
CANDC
2000
ACM
15 years 5 months ago
2000
ACM
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
187
click to vote
JMLR
2012
13 years 8 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...