We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
A key agreement protocol is utilized in a network system such that two users are able to establish a commonly shared secret key. Entities within the same security level can commun...
We have recently presented CarpeDiem, an algorithm that can be used for speeding up the evaluation of Supervised Sequential Learning (SSL) classifiers. CarpeDiem provides impress...
We describe an approach to extract attribute-value pairs from product descriptions. This allows us to represent products as sets of such attribute-value pairs to augment product d...
Katharina Probst, Rayid Ghani, Marko Krema, Andrew...