2612 search results - page 465 / 523 » Switching Graphs and Their Complexity |
COCO
2008
Springer
13 years 10 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
COMPGEOM
2008
ACM
13 years 10 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 ...
DCOSS
2008
Springer
13 years 10 months ago
2008
Springer
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
DEXA
2008
Springer
13 years 10 months ago
2008
Springer
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
DIALM
2008
ACM
13 years 10 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...