12194 search results - page 33 / 2439 » cans 2010 |
78
Voted
ACS
2010
15 years 19 days ago
2010
It it shown that geometric morphisms between elementary toposes can be represented as certain adjunctions between the corresponding categories of locales. These adjunctions are ch...
80
Voted
ALGORITHMICA
2010
15 years 19 days ago
2010
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
IJCGA
2010
14 years 9 months ago
2010
Path planning can be subject to different types of optimization. Some years ago a German researcher, U. Leuth
88
Voted
ORL
2010
14 years 7 months ago
2010
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
AML
2010
15 years 19 days ago
2010
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...