923 search results - page 18 / 185 » The Computational Structure of Progress Conditions |
IJCAI
2001
14 years 11 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
BMCBI
2010
14 years 9 months ago
2010
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
106
click to vote
JMLR
2008
14 years 9 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
76
Voted
SIROCCO
2008
14 years 11 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
IJAR
2007
14 years 9 months ago
2007
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L usi...