730 search results - page 30 / 146 » Combinatorics of Monotone Computations |
100
Voted
CAIP
1997
Springer
15 years 8 months 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...
151
click to vote
COLT
2001
Springer
15 years 8 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...
126
click to vote
ECML
1998
Springer
15 years 8 months 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...
126
click to vote
CSFW
1994
IEEE
15 years 8 months 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...
118
click to vote
ATAL
2007
Springer
15 years 10 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...