Sciweavers

180 search results - page 33 / 36
» How Thorough Is Thorough Enough
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 17 days ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
CASES
2007
ACM
14 years 13 days ago
SCCP/x: a compilation profile to support testing and verification of optimized code
Embedded systems are often used in safety-critical environments. Thus, thorough testing of them is mandatory. A quite active research area is the automatic test-case generation fo...
Raimund Kirner
ICDM
2007
IEEE
140views Data Mining» more  ICDM 2007»
14 years 9 days ago
Sequential Change Detection on Data Streams
Model-based declarative queries are becoming an attractive paradigm for interacting with many data stream applications. This has led to the development of techniques to accurately...
S. Muthukrishnan, Eric van den Berg, Yihua Wu
ATVA
2006
Springer
102views Hardware» more  ATVA 2006»
14 years 5 days ago
A Semantic Framework for Test Coverage
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...
Laura Brandán Briones, Ed Brinksma, Mari&eu...
IQ
2007
13 years 10 months ago
Rule-Based Measurement Of Data Quality In Nominal Data
: Sufficiently high data quality is crucial for almost every application. Nonetheless, data quality issues are nearly omnipresent. The reasons for poor quality cannot simply be bla...
Jochen Hipp, Markus Müller, Johannes Hohendor...