Sciweavers

1242 search results - page 243 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
SACMAT
2009
ACM
13 years 11 months ago
A formal framework to elicit roles with business meaning in RBAC systems
The role-based access control (RBAC) model has proven to be cost effective to reduce the complexity and costs of access permission management. To maximize the advantages offered...
Alessandro Colantonio, Roberto Di Pietro, Alberto ...
GECCO
2009
Springer
258views Optimization» more  GECCO 2009»
13 years 11 months ago
Evolutionary learning of local descriptor operators for object recognition
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
Cynthia B. Pérez, Gustavo Olague
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
13 years 11 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
13 years 10 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
COLT
1993
Springer
13 years 10 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum