928 search results - page 7 / 186 » The degree structure of Weihrauch-reducibility |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
CSCW
2004
ACM
14 years 1 months ago
2004
ACM
In this paper, we describe the evolution and impact of computersupported cooperative work (CSCW) research through social network analysis of coauthorship data. A network of author...
APAL
2010
13 years 7 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
AML
2010
13 years 7 months 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...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
In this paper, we present a procedure for organizing real world scenes along semantic axes. The approach is based on the output energies of linear discriminant filters that take i...