4403 search results - page 357 / 881 » Galois Theory of Algorithms |
177
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
149
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
192
click to vote
CG
2005
Springer
15 years 6 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
134
click to vote
CACM
2004
15 years 6 months ago
2004
s (theory, abstraction, and design) [2]. They put programming as a subpart of the design component of most of the nine areas, especially algorithms and software engineering. Their ...
109
click to vote
RSA
1998
15 years 6 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...