During past few years, a variety of methods have been developed for learning probabilistic networks from data, among which the heuristic single link forward or backward searches ar...
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Probabilistic Description Logics are the basis of ontologies in the Semantic Web. Knowledge representation and reasoning for these logics have been extensively explored in the last...