1331 search results - page 132 / 267 » Complexity bounds for zero-test algorithms |
204
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Background knowledge is an important factor in privacy preserving data publishing. Probabilistic distributionbased background knowledge is a powerful kind of background knowledge w...
192
click to vote
JMMA
2002
15 years 6 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
191
click to vote
JAIR
2010
15 years 4 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
148
click to vote
POPL
2000
ACM
15 years 10 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
204
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...