725 search results - page 54 / 145 » Bounding Degrees on RPL |
84
Voted
HOTNETS
2010
14 years 7 months ago
2010
Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol...
101
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
95
Voted
JAIR
1998
15 years 12 days ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
119
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
144
click to vote
COLT
1993
Springer
15 years 4 months 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...