7536 search results - page 244 / 1508 » The CLEAR 2007 Evaluation |
172
click to vote
ICONIP
1998
15 years 8 months ago
1998
This paper describes a practical application of a novel terminal attractor algorithm to the construction of Perfect Hash Functions (PHF) for a prede ned set of keys. The proposed ...
182
click to vote
FORTE
1997
15 years 8 months ago
1997
This paper presents a testing theory that is parameterised with assumptions about the way implementations communicate with their environment. In this way some existing testing the...
165
click to vote
IJCAI
1997
15 years 8 months ago
1997
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear...
179
click to vote
ECSCW
1993
15 years 8 months ago
1993
: Despite the reliance of cooperative applications on the facilities provided by distributed systems, little consideration is given by these systems to the support of cooperative w...
153
click to vote
MVA
1996
15 years 8 months ago
1996
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...