Sciweavers

15033 search results - page 359 / 3007
» Complexity Theory and Algorithms
Sort
View
216
Voted
CCS
2006
ACM
15 years 10 months ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang
AMC
2008
87views more  AMC 2008»
15 years 7 months ago
Mining classification rules with Reduced MEPAR-miner Algorithm
In this study, a new classification technique based on rough set theory and MEPAR-miner algorithm for association rule mining is introduced. Proposed method is called as `Reduced ...
Emel Kizilkaya Aydogan, Cevriye Gencer
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
16 years 19 days ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
WABI
2005
Springer
108views Bioinformatics» more  WABI 2005»
16 years 17 days ago
On the Complexity of Several Haplotyping Problems
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 11 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...