522 search results - page 29 / 105 » A Graph Theoretical Approach to Network Encoding Complexity |
110
click to vote
NN
2000
Springer
15 years 2 months ago
2000
Springer
We address two issues in Evolutionary Robotics, namely the genetic encoding and the performance criterion, also known as fitness function. For the first aspect, we suggest to enco...
158
click to vote
HICSS
2010
IEEE
15 years 9 months ago
2010
IEEE
Network security is a complex and challenging problem. The area of network defense mechanism design is receiving immense attention from the research community for more than two de...
105
click to vote
JAIR
2006
15 years 2 months ago
2006
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
152
click to vote
CVPR
2001
IEEE
16 years 5 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
103
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence betwe...