Sciweavers

2370 search results - page 213 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
CCS
2007
ACM
15 years 8 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...
KDD
2010
ACM
250views Data Mining» more  KDD 2010»
15 years 7 months ago
Modeling relational events via latent classes
Many social networks can be characterized by a sequence of dyadic interactions between individuals. Techniques for analyzing such events are of increasing interest. In this paper,...
Christopher DuBois, Padhraic Smyth
COMPGEOM
2001
ACM
15 years 7 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...
COLT
1995
Springer
15 years 7 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
ECML
1987
Springer
15 years 7 months ago
Induction in Noisy Domains
This paper examines the induction of classification rules from examples using real-world data. Real-world data is almost always characterized by two features, which are important ...
Peter Clark, Tim Niblett