Sciweavers

1274 search results - page 27 / 255
» Graph lambda theories
Sort
View
CCCG
2008
13 years 10 months ago
Computational Balloon Twisting: The Theory of Balloon Polyhedra
This paper builds a general mathematical and algorithmic theory for balloon-twisting structures, from balloon animals to balloon polyhedra, by modeling their underlying graphs (ed...
Erik D. Demaine, Martin L. Demaine, Vi Hart
POPL
2010
ACM
14 years 6 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
DMIN
2006
151views Data Mining» more  DMIN 2006»
13 years 10 months ago
Rough Set Theory: Approach for Similarity Measure in Cluster Analysis
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
Shuchita Upadhyaya, Alka Arora, Rajni Jain
ENTCS
2008
114views more  ENTCS 2008»
13 years 8 months ago
Maintaining Coherence Between Models With Distributed Rules: From Theory to Eclipse
Integrated Development Environments supporting software and model evolution have to deal with the problem of maintaining coherence between code and model despite changes which may...
Paolo Bottoni, Francesco Parisi-Presicce, Simone P...
EUROMICRO
1996
IEEE
14 years 29 days ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs