1925 search results - page 172 / 385 » Incremental test collections |
158
click to vote
COCO
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
174
click to vote
ER
2000
Springer
15 years 10 months ago
2000
Springer
: The size and complexity of modern information systems together with requirements for short development time increase the demands for reuse of already existing solutions. The idea...
165
click to vote
WSC
2007
15 years 9 months ago
2007
This paper describes the selection and automation of a method for estimating how many replications should be run to achieve a required accuracy in the output. The motivation is to...
138
click to vote
ECIR
2010
Springer
15 years 8 months ago
2010
Springer
We propose a kernel convolution method to predict similar locations (wormholes) based on human travel behaviour. A scaling parameter can be used to define a set of relevant users t...
180
click to vote
CLA
2007
15 years 8 months ago
2007
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...