882 search results - page 163 / 177 » On the Hardness of Graph Isomorphism |
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
EMSOFT
2009
Springer
14 years 3 months ago
2009
Springer
An important step in model-based embedded system design consists in mapping functional specifications and their tasks/operations onto execution architectures and their ressources...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
IMC
2009
ACM
14 years 3 months ago
2009
ACM
Understanding how users behave when they connect to social networking sites creates opportunities for better interface design, richer studies of social interactions, and improved ...