412 search results - page 38 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
116
click to vote
COMSUR
2011
13 years 11 months ago
2011
Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the netw...
ICML
2006
IEEE
16 years 19 days ago
2006
IEEE
In many applications, unlabelled examples are inexpensive and easy to obtain. Semisupervised approaches try to utilise such examples to reduce the predictive error. In this paper,...
141
click to vote
ASPDAC
2005
ACM
15 years 1 months ago
2005
ACM
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...
111
click to vote
GLOBECOM
2007
IEEE
14 years 12 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...
106
click to vote
ISPASS
2007
IEEE
15 years 6 months ago
2007
IEEE
The ongoing trend of increasing computer hardware and software complexity has resulted in the increase in complexity and overheads of cycle-accurate processor system simulation, e...