1686 search results - page 6 / 338 » Programs as polygraphs: computability and complexity |
148
Voted
ACSC
2004
IEEE
15 years 11 months ago
2004
IEEE
145
click to vote
MCU
2007
15 years 8 months ago
2007
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
243
Voted
JMLR
2012
13 years 10 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...
240
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--S4 is a general-purpose, distributed, scalable, partially fault-tolerant, pluggable platform that allows programmers to easily develop applications for processing continu...
239
click to vote
IBERAMIA
2010
Springer
15 years 5 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...