Sciweavers

470 search results - page 82 / 94
» FORM facts
Sort
View
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
14 years 2 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 2 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
WCRE
1993
IEEE
14 years 2 months ago
A Practical Program Transformation System for Reverse Engineering
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
M. Ward, K. Bennett
ICSE
1993
IEEE-ACM
14 years 2 months ago
Prototyping a Process Monitoring Experiment
Features are often the basic unit of development for a very large software systems and represent long-term efforts, spanning up to several years from inception to actual use. Deve...
Mark G. Bradac, Dewayne E. Perry, Lawrence G. Vott...
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 2 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein