2430 search results - page 403 / 486 » Computing Tutte Polynomials |
153
Voted
CCS
2008
ACM
15 years 5 months ago
2008
ACM
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
140
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
133
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
160
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
148
Voted
AAAI
2010
15 years 4 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...