Sciweavers

1998 search results - page 343 / 400
» Complexity of the Cover Polynomial
Sort
View
105
Voted
JSAC
2006
128views more  JSAC 2006»
15 years 16 days ago
A framework for misuse detection in ad hoc networks- part II
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
D. Subhadrabandhu, S. Sarkar, F. Anjum
EOR
2007
102views more  EOR 2007»
15 years 16 days ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
120
Voted
PAMI
2006
181views more  PAMI 2006»
15 years 15 days ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
TDSC
2008
152views more  TDSC 2008»
15 years 14 days ago
Towards Formal Verification of Role-Based Access Control Policies
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qih...
87
Voted
JGT
2007
99views more  JGT 2007»
15 years 14 days ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...