3897 search results - page 541 / 780 » complexity 2010 |
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider minimal-rate sampling schemes for streams of delayed and weighted versions of a known pulse shape. Such signals belong to the class of finite rate of innovation (FRI) m...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
While much work on learning in planning focused on learning domain physics (i.e., action models), and search control knowledge, little attention has been paid towards learning use...
138
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Lattice reduction-aided decoding enables significant complexity saving and near-optimum performance in multi-input multi-output (MIMO) communications. However, its remarkable perfo...