We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
—We consider the problem of identifying motifs, recurring or conserved patterns, in the sets of biological sequences. To solve this task, we present new deterministic and exact a...
This paper is to investigate rank aggregation based on multiple user-centered measures in the context of the web search. We introduce a set of techniques to combine ranking lists ...
Most classical stochastic inventory models assume that replenishment lead times are independent of the amount of orders placed. This assumption is clearly problematic in capacitat...
Abstract. This paper addresses the problem of specifying and establishing secure collaborations between autonomous entities that need to interact and depend on each other in order ...
Alberto E. Schaeffer Filho, Emil Lupu, Morris Slom...