2542 search results - page 282 / 509 » Computing Cartograms with Optimal Complexity |
111
Voted
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
In the Ad-Hoc InfoWare project, we develop a delay tolerant event notification service for sparse Mobile Ad-Hoc Networks for emergency and rescue operations. In most event notific...
63
Voted
AAECC
2007
Springer
15 years 6 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
107
click to vote
BIRTHDAY
2003
Springer
15 years 5 months ago
2003
Springer
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
111
click to vote
JGAA
2006
15 years 14 days ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
104
Voted
CN
2002
15 years 9 days ago
2002
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...