Sciweavers

860 search results - page 33 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
SOFSEM
2012
Springer
12 years 3 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
13 years 9 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
14 years 5 days ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
TVLSI
2010
13 years 2 months ago
Test Data Compression Using Efficient Bitmask and Dictionary Selection Methods
Abstract--Higher circuit densities in system-on-chip (SOC) designs have led to drastic increase in test data volume. Larger test data size demands not only higher memory requiremen...
Kanad Basu, Prabhat Mishra
STACS
2009
Springer
14 years 2 months ago
Quantum Query Complexity of Multilinear Identity Testing
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay