2969 search results - page 289 / 594 » A space efficient algorithm for group structure computation |
138
click to vote
CCS
2008
ACM
15 years 6 months ago
2008
ACM
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...
143
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
131
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
140
click to vote
CAD
2005
Springer
15 years 4 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
189
click to vote
CGIM
2003
15 years 5 months ago
2003
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...