228 search results - page 1 / 46 » Estimating Commit Sizes Efficiently |
OSS
2009
Springer
13 years 11 months ago
2009
Springer
The quantitative analysis of software projects can provide insights that let us better understand open source and other software development projects. An important variable used in...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
ISSS
1997
IEEE
13 years 9 months ago
1997
IEEE
This paper presents a model for simultaneous instruction selection, compaction, and register allocation. An arc mapping model along with logical propositions is used to create an ...
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
In this work we tackle the open problem of self-join size (SJS) estimation in a large-scale Distributed Data System, where tuples of a relation are distributed over data nodes whic...