2016 search results - page 183 / 404 » Megamaps: Construction and Examples |
116
click to vote
DM
2006
15 years 6 months ago
2006
By a very simple argument, we prove that if l, m, n {0, 1, 2, . . . } then l k=0 (-1)m-k l k m - k n 2k k - 2l + m = l k=0 l k 2k n n - l m + n - 3k - l . On the basis of this ide...
140
click to vote
ENTCS
2006
15 years 6 months ago
2006
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
163
click to vote
ENTCS
2006
15 years 6 months ago
2006
Howe's method is a well-known technique for proving that various kinds of applicative bisimilarity (or similarity) on a functional language are congruences (or precongruences...
148
click to vote
ENVSOFT
2006
15 years 6 months ago
2006
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...
180
click to vote
CAD
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...