8512 search results - page 380 / 1703 » Computing Theory With Relevance |
212
click to vote
TYPES
1998
Springer
15 years 11 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
165
click to vote
FOCS
2006
IEEE
16 years 25 days ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
178
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
209
click to vote
CMSB
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. This paper tackles theoretically the question of the structural stability of biological regulation networks subjected to the influence of their environment. The model of...
157
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...