Sciweavers

411 search results - page 78 / 83
» Algebraic Imperative Specifications
Sort
View
112
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 2 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 2 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay
ICFP
2005
ACM
16 years 1 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
CCGRID
2006
IEEE
15 years 8 months ago
Component-Based Modeling, Analysis and Animation
Component-based software construction is widely used in a variety of applications, from embedded environments to grid computing. However, errors in these applications and systems ...
Jeff Kramer
116
Voted
ICSE
2003
IEEE-ACM
15 years 7 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory