1204 search results - page 134 / 241 » Termination of Polynomial Programs |
127
click to vote
OPODIS
2003
15 years 2 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
156
click to vote
COLT
1994
Springer
15 years 4 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
123
Voted
BMCBI
2007
15 years 25 days ago
2007
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
126
Voted
JMLR
2012
13 years 3 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...