Sciweavers

3466 search results - page 25 / 694
» Fast computation of special resultants
Sort
View
NA
2006
84views more  NA 2006»
13 years 11 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
PAMI
2012
12 years 1 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
14 years 5 months ago
Fast computation of frequency response functions for a class of nonlinear systems
— One of the important and efficient tools in system analysis is the analysis of responses to harmonic excitations. For linear systems the information on such responses is conta...
Alexey V. Pavlov, Nathan van de Wouw
CAD
2006
Springer
13 years 11 months ago
Fast computation of inertia through affinely extended Euler tensor
We introduce an affine extension of the Euler tensor which encompasses all of the inertia properties of interest in a convenient linear format, and we show how it transforms under...
Antonio DiCarlo, Alberto Paoluzzi
DIS
2007
Springer
14 years 5 months ago
Fast NML Computation for Naive Bayes Models
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...
Tommi Mononen, Petri Myllymäki