Sciweavers

860 search results - page 30 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
13 years 7 months ago
A Note on a Problem of Hilliker and Straus
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
Miroslawa Janczak
ITC
2003
IEEE
139views Hardware» more  ITC 2003»
14 years 28 days ago
A Hybrid Coding Strategy For Optimized Test Data Compression
Store-and-generate techniques encode a given test set and regenerate the original test set during the test with the help of a decoder. Previous research has shown that runlength c...
Armin Würtenberger, Christofer S. Tautermann,...
BMCBI
2008
85views more  BMCBI 2008»
13 years 7 months ago
Merging microarray data from separate breast cancer studies provides a robust prognostic test
Background: There is an urgent need for new prognostic markers of breast cancer metastases to ensure that newly diagnosed patients receive appropriate therapy. Recent studies have...
Lei Xu, Aik Choon Tan, Raimond L. Winslow, Donald ...
TIT
2010
103views Education» more  TIT 2010»
13 years 2 months ago
Codes in permutations and error correction for rank modulation
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
Alexander Barg, Arya Mazumdar
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
14 years 1 months ago
Effectiveness Bounds for Non-Exhaustive Schema Matching Systems
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
Marko Smiljanic, Maurice van Keulen, Willem Jonker