4158 search results - page 591 / 832 » A Framework for Web Science |
136
click to vote
LICS
2007
IEEE
16 years 16 days ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
169
click to vote
ICALP
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
168
click to vote
ICALP
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
148
click to vote
ICANN
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
167
Voted
SARA
2007
Springer
16 years 11 days ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...