Sciweavers

412 search results - page 77 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
140
Voted
NIPS
2008
14 years 11 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
15 years 4 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...
ATAL
2008
Springer
14 years 11 months ago
A realistic model of frequency-based multi-robot polyline patrolling
There is growing interest in multi-robot frequency-based patrolling, in which a team of robots optimizes its frequency of point visits, for every point in a target work area. In p...
Yehuda Elmaliach, Asaf Shiloni, Gal A. Kaminka
BMCBI
2005
94views more  BMCBI 2005»
14 years 9 months ago
YANA - a software tool for analyzing flux modes, gene-expression and enzyme activities
Background: A number of algorithms for steady state analysis of metabolic networks have been developed over the years. Of these, Elementary Mode Analysis (EMA) has proven especial...
Roland Schwarz, Patrick Musch, Axel von Kamp, Bern...
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
14 years 11 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...