Search

Your search keyword '"Colbourn, Charles J."' showing total 993 results
Start Over Author "Colbourn, Charles J."
993 results on '"Colbourn, Charles J."'

55. Sequence Covering Arrays and Linear Extensions

Author

Murray, Patrick C., Colbourn, Charles J., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Jan, Kratochvíl, editor, Miller, Mirka, editor, and Froncek, Dalibor, editor

Published
2015
Full Text
View/download PDF

60. Scalable level-wise screening experiments using locating arrays

Author

Akhtar, Yasmeen, Zhang, Fan, Colbourn, Charles J., Stufken, John, and Syrotiuk, Violet R.

Abstract

Alternative design and analysis methods for screening experiments based on locating arrays are presented. The number of runs in a locating array grows logarithmically based on the number of factors, providing efficient methods for screening complex engineered systems, especially those with large numbers of categorical factors having different numbers of levels. Our analysis method focuses on levels of factors in the identification of important main effects and two-way interactions. We demonstrate the validity of our design and analysis methods on both well-studied and synthetic data sets and investigate both statistical and combinatorial properties of locating arrays that appear to be related to their screening capability.

Published
2023
Full Text
View/download PDF

63. Randomized Post-optimization for t-Restrictions

Author

Colbourn, Charles J., Nayeri, Peyman, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Aydinian, Harout, editor, Cicalese, Ferdinando, editor, and Deppe, Christian, editor

Published
2013
Full Text
View/download PDF

64. Variable Weight Sequences for Adaptive Scheduled Access in MANETs

Author

Lutz, Jonathan, Colbourn, Charles J., Syrotiuk, Violet R., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Helleseth, Tor, editor, and Jedwab, Jonathan, editor

Published
2012
Full Text
View/download PDF

65. Efficient Conditional Expectation Algorithms for Constructing Hash Families

Author

Colbourn, Charles J., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Iliopoulos, Costas S., editor, and Smyth, William F., editor

Published
2011
Full Text
View/download PDF

66. Randomized Postoptimization of Covering Arrays

Author

Nayeri, Peyman, Colbourn, Charles J., Konjevod, Goran, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Fiala, Jiří, editor, Kratochvíl, Jan, editor, and Miller, Mirka, editor

Published
2009
Full Text
View/download PDF

67. Binary Covering Arrays and Existentially Closed Graphs

Author

Colbourn, Charles J., Kéri, Gerzson, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Chee, Yeow Meng, editor, Li, Chao, editor, Ling, San, editor, Wang, Huaxiong, editor, and Xing, Chaoping, editor

Published
2009
Full Text
View/download PDF

89. A recursive construction for perfect hash families

Author

Colbourn Charles J. and Ling Alan C. H.

Subjects
orthogonal array, perfect hash family, distributing hash family, Mathematics, QA1-939
Abstract

A known recursive construction for perfect hash families multiplies the number of factors by q, where q is the largest prime power not exceeding the number of symbols. This is generalized to permit multiplication of the number of factors by powers of q; it is also improved upon by restricting the structure of the ingredient designs. For a perfect hash family of strength t, it may be possible to order its rows so that, for each , the first Ni rows form a perfect hash family of strength . This ‘matroshka’ ordering underlies a sometimes substantial reduction in the number of rows generated by the recursive construction. Perfect hash families with useful matroshka orderings are generated using linear orthogonal arrays, and with an effective one-row-at-a-time greedy algorithm.

Published
2009
Full Text
View/download PDF

90. Perfect Hash Families: Constructions and Existence

Author

Walker II Robert A. and Colbourn Charles J.

Subjects
perfect hash family, interaction testing, three-term arithmetic progression., Mathematics, QA1-939
Abstract

A perfect hash family PHF(N; k, v, t) is an N × k array on v symbols with v ≥ t, in which in every N × t subarray, at least one row is comprised of distinct symbols. Perfect hash families have a wide range of applications in cryptography, particularly to secure frameproof codes, in database management, and indirectly in software interaction testing. New recursive constructions, new direct constructions, and PHFs found using tabu search are provided here. The first general tables of the best known sizes of PHFs are presented; in the process, the known direct and recursive constructions are surveyed.

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results