1650 search results - page 140 / 330 » The HOM problem is decidable |
293
click to vote
PE
2011
Springer
14 years 11 months ago
2011
Springer
This paper studies the optimal resource allocation in time-reservation systems. Customers arrive at a service facility and receive service in two steps; in the first step informa...
151
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
122
click to vote
PG
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper we consider the problem of reconstructing triangular surfaces from given contours. An algorithm solving this problem has to decide which contours of two successive s...
147
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
136
click to vote
PRL
2006
15 years 4 months ago
2006
Regularized linear classifiers have been successfully applied in undersampled, i.e. small sample size/high dimensionality biomedical classification problems. Additionally, a desig...