787 search results - page 46 / 158 » Polynomial Constants are Decidable |
MOC
2010
13 years 2 months ago
2010
In this paper, a Jacobi-collocation spectral method is developed for Volterra integral equations of the second kind with a weakly singular kernel. We use some function transformati...
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
COLT
1993
Springer
14 years 4 days ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...