Sciweavers

1379 search results - page 163 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Approximating loops in a shortest homology basis from point data
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...
Tamal K. Dey, Jian Sun, Yusu Wang
COMPGEOM
2010
ACM
15 years 11 months ago
Optimal reconstruction might be hard
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...
Dominique Attali, André Lieutier
CCS
2007
ACM
15 years 10 months ago
Efficient policy analysis for administrative role based access control
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...
Scott D. Stoller, Ping Yang, C. R. Ramakrishnan, M...
DLT
2003
15 years 7 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
NIPS
2003
15 years 7 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini