Sciweavers

119 search results - page 19 / 24
» Batch Range Proof for Practical Small Ranges
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 2 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
JCP
2007
154views more  JCP 2007»
14 years 9 months ago
Introducing Virtual Private Overlay Network Services in Large Scale Grid Infrastructures
—The computational Grid concept is gaining great popularity as the best way to deliver access to a wide range of distributed computing and data resources. But, as Grids move from...
Francesco Palmieri
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
15 years 6 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
GLVLSI
2003
IEEE
130views VLSI» more  GLVLSI 2003»
15 years 2 months ago
Zero overhead watermarking technique for FPGA designs
FPGAs, because of their re-programmability, are becoming very popular for creating and exchanging VLSI intellectual properties (IPs) in the reuse-based design paradigm. Existing w...
Adarsh K. Jain, Lin Yuan, Pushkin R. Pari, Gang Qu
DCC
2006
IEEE
15 years 9 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford