Sciweavers

1051 search results - page 58 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
SACMAT
2010
ACM
15 years 4 months ago
Role mining based on weights
Role mining from the existing permissions has been widely applied to aid the process of migrating to an RBAC system. While all permissions are treated evenly in previous approache...
Xiaopu Ma, Ruixuan Li, Zhengding Lu
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 7 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 6 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
FCT
2001
Springer
15 years 10 months ago
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...
Victor L. Selivanov