7351 search results - page 1065 / 1471 » Segmenting Point Sets |
163
click to vote
JAR
2000
15 years 6 months ago
2000
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
184
click to vote
NJC
2000
15 years 6 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
168
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
122
click to vote
JAT
2002
15 years 6 months ago
2002
We investigate polynomials satisfying a three-term recurrence relation of the form Bn(x) = (x - n)Bn-1(x) - nxBn-2(x), with positive recurrence coefficients n+1, n (n = 1, 2, . . ...
176
click to vote
JILP
2002
15 years 6 months ago
2002
As microprocessor designs continue to evolve, many optimizations reach a point of diminishing returns. We introduce HLS, a hybrid processor simulator which uses statistical models...