1383 search results - page 165 / 277 » On the Complexity of the Interlace Polynomial |
161
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...
154
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...
187
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
156
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
204
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...