Sciweavers

740 search results - page 28 / 148
» FAST Extended Release
Sort
View
NIPS
2008
13 years 11 months ago
Fast Rates for Regularized Objectives
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
Karthik Sridharan, Shai Shalev-Shwartz, Nathan Sre...
AIPS
2006
13 years 11 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
TROB
2008
136views more  TROB 2008»
13 years 9 months ago
Fast and Incremental Method for Loop-Closure Detection Using Bags of Visual Words
Abstract--In robotic applications of visual simultaneous localization and mapping techniques, loop-closure detection and global localization are two issues that require the capacit...
Adrien Angeli, David Filliat, Stéphane Donc...
TPDS
2002
94views more  TPDS 2002»
13 years 9 months ago
Recursive Array Layouts and Fast Matrix Multiplication
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
ICASSP
2011
IEEE
13 years 1 months ago
Fast discriminative speaker verification in the i-vector space
This work presents a new approach to discriminative speaker verification. Rather than estimating speaker models, or a model that discriminates between a speaker class and the cla...
Sandro Cumani, Niko Brümmer, Lukas Burget, Pi...