OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:inefficient
(Results
1 - 3
of
3
) sorted by null
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tools.pas
341
/// This could be done using hashing or binary search, but this is
inefficient
Antlr.Runtime.Tree.pas
[
all
...]
/external/ceres-solver/docs/
solving.tex
238
Large non-linear least square problems are usually sparse. In such cases, using a dense QR factorization is
inefficient
. Let $H = R^\top R$ be the Cholesky factorization of the normal equations, where $R$ is an upper triangular matrix, then the solution to ~\eqref{eq:normal} is given by
[
all
...]
Completed in 199 milliseconds