Sciweavers

6167 search results - page 280 / 1234
» Can Refinement be Automated
Sort
View
VMV
2000
169views Visualization» more  VMV 2000»
15 years 8 months ago
A Non-Linear Subdivision Scheme for Triangle Meshes
Subdivision schemes are commonly used to obtain dense or smooth data representations from sparse discrete data. E. g., B-splines are smooth curves or surfaces that can be construc...
Stefan Karbacher, Stephan Seeger, Gerd Häusle...
FORTE
1990
15 years 8 months ago
Verifying Bisimulations "On the Fly"
This paper describes a decision procedure for bisimulation-based equivalence relations between labeled transition systems. The algorithm usually performed in order to verify bisim...
Jean-Claude Fernandez, Laurent Mounier
160
Voted
EJC
2010
15 years 7 months ago
A q-enumeration of alternating permutations
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a...
Matthieu Josuat-Vergès
ENTCS
2008
89views more  ENTCS 2008»
15 years 7 months ago
Dataflow Architectures for GALS
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla
ACTA
2005
104views more  ACTA 2005»
15 years 7 months ago
Subtyping for session types in the pi calculus
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...
Simon J. Gay, Malcolm Hole