269 search results - page 45 / 54 » Complexity Theory Made Easy |
SPAA
2009
ACM
14 years 3 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
CCS
2007
ACM
14 years 2 months ago
2007
ACM
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...