4850 search results - page 378 / 970 » Proof and Computation in Geometry |
217
click to vote
CGF
2011
14 years 10 months ago
2011
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
169
click to vote
IJFCS
2011
15 years 1 months ago
2011
some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to pology. In turn, the ...
150
Voted
FOSSACS
2004
Springer
16 years 7 days ago
2004
Springer
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
160
click to vote
COMPUTING
2007
15 years 6 months ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
171
click to vote
MSCS
2006
15 years 6 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...