Divide and conquer: recovering contextual information of behaviors in Android apps around limited-quantity audit logs
Abstract
References
Recommendations
A divide and conquer approach to shortest paths in planar layered digraphs
SPDP '92: Proceedings of the 1992 Fourth IEEE Symposium on Parallel and Distributed ProcessingThe authors give efficient parallel algorithms to compute shortest-paths in planar layered digraphs. They show that these digraphs admit special kinds of separators, called one-way separators, which allow paths in the graph to cross them only once. They ...
A divide and conquer algorithm for d-dimensional arrangement
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithmsWe give an O(√log n)-approximation algorithm for d-dimensional arrangement - the problem of mapping a graph to a d-dimensional grid (for constant d ≥ 2) to minimize the sum of edge lengths. This improves the previous best O(log n log log n) ...
Approximations and Optimal Geometric Divide-and-Conquer
We give an efficient deterministic algorithm for computing -approximations and -nets for range spaces of bounded VC-dimension. We assume that an n-point range space = (X, R) of VC-dimension d is given to us by an oracle, which given a subset A X, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- Conference Chair:
- Gunter Mussbacher,
- General Chair:
- Joanne M. Atlee,
- Program Chair:
- Tevfik Bultan
Sponsors
- SIGSOFT: ACM Special Interest Group on Software Engineering
- IEEE-CS: Computer Society
Publisher
IEEE Press
Publication History
Check for updates
Qualifiers
- Research-article
Conference
- SIGSOFT
- IEEE-CS
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 50Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in