Sciweavers

2531 search results - page 236 / 507
» Group testing in graphs
Sort
View
JCO
2008
85views more  JCO 2008»
15 years 6 months ago
Locating and detecting arrays for interaction faults
The identification of interaction faults in component-based systems has focussed on indicating the presence of faults, rather than their location and magnitude. While this is a va...
Charles J. Colbourn, Daniel W. McClary
NAACL
1994
15 years 7 months ago
The Hub and Spoke Paradigm for CSR Evaluation
In this paper, we introduce the new paradigm used in the most recent ARPA-sponsoredContinuousSpeech Recognition(CSR) evaluation and then discuss the important features of the test...
Francis Kubala, Jerome R. Bellegarda, Jordan Cohen...
CCS
2009
ACM
16 years 7 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
STACS
2010
Springer
16 years 1 months ago
Evasiveness and the Distribution of Prime Numbers
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
László Babai, Anandam Banerjee, Ragh...
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 10 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah