2520 search results - page 347 / 504 » The complexity of approximating entropy |
124
click to vote
ADT
2008
15 years 4 months ago
2008
By range-free localization, the positions of a mobile device can be limited to the coverage area of a radio access network cell. The drawback of such approach is the coarseness of ...
111
click to vote
CGF
2008
15 years 4 months ago
2008
The powerful yet conceptually simple notions of Finite-Time Lyapunov Exponent (FTLE) and Lagrangian Coherent Structures provide a powerful framework for the analysis and visualiza...
126
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We analyze the sensitivity of the capacity of a multi-antenna multi-user system to the number of users being served. We show analytically that, for a given desired sum-rate, the e...
127
Voted
CN
2006
15 years 4 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
111
click to vote
EOR
2006
15 years 4 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...