1089 search results - page 108 / 218 » Bounds on generalized Frobenius numbers |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
SIROCCO
2004
13 years 10 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
GIS
2006
ACM
13 years 9 months ago
2006
ACM
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
COCOA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
APPROX
2006
Springer
14 years 23 days ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...