730 search results - page 30 / 146 » Combinatorics of Monotone Computations |
CAIP
1997
Springer
14 years 25 days ago
1997
Springer
The use of digital image analysis in architectural photogrammetry allows the automation of monotonous low-level tasks and makes the interpretation of facades much easier. Different...
COLT
2001
Springer
14 years 1 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
ECML
1998
Springer
14 years 27 days ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
CSFW
1994
IEEE
14 years 24 days ago
1994
IEEE
We analyze the safety question for the Non-Monotonic Transform NMT model, an access control model that encompasses a wide variety of practical access control mechanisms. In genera...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...