3044 search results - page 142 / 609 » Linear logical approximations |
96
Voted
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We solve the open problem of the decidability of Boolean BI logic (BBI), which can be considered as the core of separation and spatial logics. For this, we define a complete phas...
135
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
129
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
116
click to vote
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
This paper presents a method to speed up support vector classification, especially important when data is highdimensional. Unlike previous approaches which focus on less support v...
122
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...