Sciweavers

1937 search results - page 313 / 388
» Starting B Specifications from Use Cases
Sort
View
ICFP
2005
ACM
16 years 4 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
ENTCS
2006
183views more  ENTCS 2006»
15 years 4 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...
137
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 4 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
TC
1998
15 years 6 months ago
Propagating Integrity Information among Interrelated Databases
Data integrity policies often require that quality and integrity metadata be generated and communicated to potential users. However, in data warehouses, federations, and other mul...
Arnon Rosenthal, Edward Sciore
156
Voted
WWW
2007
ACM
16 years 5 months ago
Web4CE: accessing web-based applications on consumer devices
In a world where all devices will be interconnected, the boundaries between the different devices will start to disappear. Devices will be able to access each other's applica...
Walter Dees, Paul Shrubsole