14548 search results - page 2878 / 2910 » The Optimal Path-Matching Problem |
COLT
2004
Springer
14 years 15 days ago
2004
Springer
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
ATVA
2006
Springer
14 years 15 days ago
2006
Springer
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...
CSB
2004
IEEE
14 years 15 days ago
2004
IEEE
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
CRYPTO
2006
Springer
14 years 15 days ago
2006
Springer
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
LCPC
2000
Springer
14 years 10 days ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...