1134 search results - page 80 / 227 » Composing Tests from Examples |
SBBD
2001
15 years 16 days ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
APAL
2010
14 years 11 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
104
click to vote
TSI
2008
14 years 11 months ago
2008
Ubiquitous applications are facing a large diversity of execution contexts. However, this diversity requires some continual adaptation to preserve the correct execution of these ap...
CGF
1998
14 years 11 months ago
1998
This paper describes the prototype of a facial expression editor. In contrast to existing systems the presented editor takes advantage of both medical data for the simulation and ...
ECSQARU
2003
Springer
15 years 4 months ago
2003
Springer
To make qualified decisions when extrapolating results from a survey sample with imprecise tests requires careful handling of uncertainty. Both the imprecise test and uncertainty ...