1101 search results - page 147 / 221 » Forcing in proof theory |
92
Voted
IJCAI
1989
15 years 1 months ago
1989
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
126
click to vote
CRYPTO
2010
Springer
15 years 1 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
108
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
112
Voted
ICASSP
2010
IEEE
15 years 24 days ago
2010
IEEE
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
93
Voted
AML
2008
15 years 22 days ago
2008
This document is a survey of the four papers [H], [Sch], [Com], [FandH]. It gives the relevant background and shows how the papers fit together to form a whole. Material from thos...