Sciweavers

247 search results - page 11 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
AOSD
2007
ACM
13 years 11 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
14 years 1 months ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
12 years 3 months ago
Subspace LWE
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
Krzysztof Pietrzak
ICASSP
2010
IEEE
13 years 7 months ago
Under-determined convolutive blind source separation using spatial covariance models
This paper deals with the problem of under-determined convolutive blind source separation. We model the contribution of each source to all mixture channels in the time-frequency d...
Ngoc Q. K. Duong, Emmanuel Vincent, Rémi Gr...
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...