412 search results - page 81 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
ALT
1995
Springer
13 years 9 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
STOC
1998
ACM
13 years 10 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
MOBICOM
2010
ACM
13 years 6 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
MOBISYS
2010
ACM
13 years 8 months ago
2010
ACM
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...