882 search results - page 165 / 177 » On the Hardness of Graph Isomorphism |
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
ISSTA
2006
ACM
14 years 2 months ago
2006
ACM
This paper presents a specification-based testing approach that compares software specifications defined at different f abstraction, e.g. architecture and implementation, agai...
MOBIHOC
2006
ACM
14 years 2 months ago
2006
ACM
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
SACMAT
2006
ACM
14 years 2 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
SENSYS
2006
ACM
14 years 2 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...