3850 search results - page 200 / 770 » Optimal Linear Broadcast |
128
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
115
click to vote
PKC
2009
Springer
16 years 4 months ago
2009
Springer
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...
125
click to vote
VLSID
2003
IEEE
16 years 4 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
157
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
125
click to vote
ICCD
2004
IEEE
16 years 19 days ago
2004
IEEE
Network-on-chip (NoC) has been proposed as a solution for the communication challenges of System-on-chip (SoC) design in the nanoscale regime. SoC design offers the opportunity fo...