Sciweavers

4298 search results - page 265 / 860
» Measurable chromatic numbers
Sort
View
PKC
1999
Springer
83views Cryptology» more  PKC 1999»
15 years 11 months ago
On the Security of Random Sources
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
Jean-Sébastien Coron
SIGCOMM
1998
ACM
15 years 11 months ago
A Digital Fountain Approach to Reliable Distribution of Bulk Data
—The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. ...
John W. Byers, Michael Luby, Michael Mitzenmacher,...
ICCAD
1996
IEEE
144views Hardware» more  ICCAD 1996»
15 years 11 months ago
Validation coverage analysis for complex digital designs
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
Richard C. Ho, Mark Horowitz
PODC
2010
ACM
15 years 10 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen