1410 search results - page 217 / 282 » Proving theorems by reuse |
118
click to vote
IMR
2003
Springer
15 years 7 months ago
2003
Springer
We present a new mesh warping algorithm for tetrahedral meshes based upon weighted laplacian smoothing. We start with a 3D domain which is bounded by a triangulated surface mesh a...
114
click to vote
BICOB
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...
131
click to vote
CSL
2009
Springer
15 years 5 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
138
click to vote
KBSE
2000
IEEE
15 years 5 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
137
click to vote
BIRTHDAY
2010
Springer
15 years 3 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...