2168 search results - page 175 / 434 » Randomized Algorithms and Complexity Theory |
147
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
107
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Let X be a discrete random variable with support S and f : S S be a bijection. Then it is wellknown that the entropy of X is the same as the entropy of f(X). This entropy preserva...
140
Voted
IJAR
2010
15 years 2 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
114
Voted
AB
2007
Springer
15 years 7 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
119
Voted
AAAI
1994
15 years 4 months ago
1994
We present a formal theory of model-based testing, an algorithm for test generation based on it, and outline how testing is implemented by a diagnostic engine. The key to making t...