5115 search results - page 560 / 1023 » On Randomized Lanczos Algorithms |
221
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
173
click to vote
CACM
2008
15 years 6 months ago
2008
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
216
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: To identify differentially expressed genes, it is standard practice to test a twosample hypothesis for each gene with a proper adjustment for multiple testing. Such te...
195
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
201
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...