168 search results - page 19 / 34 » Making Applications Persistent at Run-time |
KDD
2009
ACM
14 years 10 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
IPCO
2010
13 years 11 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
ISQED
2005
IEEE
14 years 3 months ago
2005
IEEE
Hierarchical approach greatly facilitates large-scale chip design by hiding distracting details in low-level objects. However, the lowlevel designs have to have a global view of h...
EUROSEC
2010
ACM
14 years 3 months ago
2010
ACM
We present a storage management framework for Web 2.0 services that places users back in control of their data. Current Web services complicate data management due to data lock-in...
CGF
2004
13 years 9 months ago
2004
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...