Sciweavers

8294 search results - page 287 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
VLDB
2007
ACM
137views Database» more  VLDB 2007»
16 years 22 days ago
Detecting Attribute Dependencies from Query Feedback
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
Peter J. Haas, Fabian Hueske, Volker Markl
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 6 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
CCS
2009
ACM
16 years 1 months ago
A probabilistic approach to hybrid role mining
Role mining algorithms address an important access control problem: configuring a role-based access control system. Given a direct assignment of users to permissions, role mining...
Mario Frank, Andreas P. Streich, David A. Basin, J...
DIWEB
2001
15 years 8 months ago
Converting XML Data To UML Diagrams For Conceptual Data Integration
The demand for data integration is rapidly becoming larger as more and more information sources appear in modern enterprises. In many situations a logical (rather than physical) i...
Mikael R. Jensen, Thomas H. Møller, Torben ...