Sciweavers

1653 search results - page 140 / 331
» Efficient Multidimensional Sampling
Sort
View
RAS
2008
142views more  RAS 2008»
15 years 4 months ago
Motion intention recognition in robot assisted applications
Acquiring, representing and modeling human skills is one of the key research areas in teleoperation, programming-by-demonstration and human-machine collaborative settings. The pro...
Daniel Aarno, Danica Kragic
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 5 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
128
Voted
ICML
2008
IEEE
16 years 5 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
VLSID
2005
IEEE
123views VLSI» more  VLSID 2005»
16 years 4 months ago
Variance Reduction in Monte Carlo Capacitance Extraction
In this article we address efficiency issues in implementation of Monte Carlo algorithm for 3D capacitance extraction. Error bounds in statistical capacitance estimation are discus...
Shabbir H. Batterywala, Madhav P. Desai
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 8 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley