Sciweavers

1653 search results - page 288 / 331
» Efficient Multidimensional Sampling
Sort
View
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 9 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
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...
Sertac Karaman, Emilio Frazzoli
CORR
2010
Springer
186views Education» more  CORR 2010»
14 years 9 months ago
Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
Quanquan Liang, Mingyan Liu
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...
CSDA
2010
157views more  CSDA 2010»
14 years 9 months ago
Robust estimation of constrained covariance matrices for confirmatory factor analysis
Confirmatory factor analysis (CFA) is a data anylsis procedure that is widely used in social and behavioral sciences in general and other applied sciences that deal with large qua...
E. Dupuis Lozeron, M. P. Victoria-Feser
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys