Sciweavers

1241 search results - page 78 / 249
» Path-oriented random testing
Sort
View
119
Voted
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
15 years 11 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
129
Voted
INFOCOM
2003
IEEE
15 years 10 months ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
117
Voted
ICASSP
2008
IEEE
15 years 11 months ago
Minimum mean bayes risk error quantization of prior probabilities
Bayesian hypothesis testing is investigated when the prior probabilities of the hypotheses, taken as a random vector, must be quantized. Nearest neighbor and centroid conditions f...
Kush R. Varshney, Lav R. Varshney
ICCAD
1990
IEEE
105views Hardware» more  ICCAD 1990»
15 years 8 months ago
Partial Detectability Profiles
Partial detectability profiles are formed by randomly sampling each fault's detectability and are used in estimating the fault coverage of random input test vectors on combin...
Paul G. Ryan, W. Kent Fuchs
RANDOM
1999
Springer
15 years 9 months ago
Fast Approximate PCPs for Multidimensional Bin-Packing Problems
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
Tugkan Batu, Ronitt Rubinfeld, Patrick White