13621 search results - page 346 / 2725 » Computability and Complexity in Self-assembly |
183
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
177
click to vote
VIZSEC
2004
Springer
16 years 3 days ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
172
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
211
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
183
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measuremen...