Sciweavers

7123 search results - page 383 / 1425
» The Ordered Set of Rough Sets
Sort
View
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
15 years 10 months ago
Permutation Groups in NC
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 ...
László Babai, Eugene M. Luks, &Aacut...
BIBM
2009
IEEE
113views Bioinformatics» more  BIBM 2009»
15 years 10 months ago
Fast Motif Selection for Biological Sequences
—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...
Pavel P. Kuksa, Vladimir Pavlovic
AAAI
2007
15 years 9 months ago
Aggregating User-Centered Rankings to Improve Web Search
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 ...
Lin Li, Zhenglu Yang, Masaru Kitsuregawa
WSC
2007
15 years 9 months ago
Determining safety stocks in the presence of workload-dependent lead times
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...
Seza Orcun, Sila Çetinkaya, Reha Uzsoy
AIMS
2008
Springer
15 years 8 months ago
A Role-Based Infrastructure for the Management of Dynamic Communities
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...