2520 search results - page 250 / 504 » The complexity of approximating entropy |
187
click to vote
IROS
2008
IEEE
16 years 1 months ago
2008
IEEE
— High performance and compliant robot control requires accurate dynamics models which cannot be obtained analytically for sufficiently complex robot systems. In such cases, mac...
193
click to vote
ICC
2007
IEEE
16 years 28 days ago
2007
IEEE
Abstract—Most research on differential MIMO is based on spacetime block codes, aiming to achieve maximum transmit diversity and thus make the transmission more robust by the aid ...
172
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
174
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
168
click to vote
IJCNN
2006
IEEE
16 years 19 days ago
2006
IEEE
— This paper shows the advantage of using neural network modularity over conventional learning schemes to approximate complex functions. Indeed, it is difficult for artificial ...