74 search results - page 7 / 15 » The communication complexity of the Hamming distance problem |
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Network-on-Chip (NoC)-based communication represents a promising solution to complex on-chip communication problems. Due to their regular structure, mesh-like NoC architectures ha...
ISCAPDCS
2001
13 years 9 months ago
2001
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
CANDC
2005
ACM
13 years 9 months ago
2005
ACM
The power of the unaided, individual mind is highly overrated: The Renaissance scholar no longer exists. Although creative individuals are often thought of as working in isolation...
WG
1998
Springer
13 years 12 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...