| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/java/android/bordeaux/learning/ |
| StochasticLinearRanker.java | 30 * Stochastic Linear Ranker, learns how to rank a sample. The learned rank score
34 * one having higher rank than the second one.
35 * To get the rank score of the sample call scoreSample.
64 * keys and values. The first sample should have higher rank than the second
77 * Get the rank score of the sample, a sample is a list of key, value pairs.
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| Hotseat.java | 86 int getCellXFromOrder(int rank) {
87 return hasVerticalHotseat() ? 0 : rank;
89 int getCellYFromOrder(int rank) {
90 return hasVerticalHotseat() ? (mContent.getCountY() - (rank + 1)) : 0;
92 public boolean isAllAppsButtonRank(int rank) {
93 return rank == mAllAppsButtonRank;
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 34 * Note that no pivoting is performed. This is \b not a rank-revealing decomposition.
289 const Index rank = (std::min)(rows, cols); local
296 dec().matrixQR().leftCols(rank),
297 dec().hCoeffs().head(rank)).transpose()
301 .topLeftCorner(rank, rank)
303 .solveInPlace(c.topRows(rank));
305 dst.topRows(rank) = c.topRows(rank);
306 dst.bottomRows(cols-rank).setZero()
[all...] |
| FullPivHouseholderQR.h | 32 * \brief Householder rank-revealing QR decomposition of a matrix with full pivoting
36 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
44 * This decomposition performs a very prudent full pivoting in order to be rank-revealing and achieve optimal
196 /** \returns the rank of the matrix of which *this is the QR decomposition.
202 inline Index rank() const function in class:Eigen::FullPivHouseholderQR
221 return cols() - rank();
234 return rank() == cols();
247 return rank() == rows();
279 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
317 /** Returns the threshold that will be used by certain methods such as rank()
[all...] |
| ColPivHouseholderQR.h | 20 * \brief Householder rank-revealing QR decomposition of a matrix with column-pivoting
24 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
32 * This decomposition performs column pivoting in order to be rank-revealing and improve
176 /** \returns the rank of the matrix of which *this is the QR decomposition.
182 inline Index rank() const function in class:Eigen::ColPivHouseholderQR
201 return cols() - rank();
214 return rank() == cols();
227 return rank() == rows();
260 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
298 /** Returns the threshold that will be used by certain methods such as rank()
[all...] |
| /external/eigen/doc/ |
| C06_TutorialLinearAlgebra.dox | 230 \section TutorialLinAlgRankRevealing Rank-revealing decompositions
232 Certain decompositions are rank-revealing, i.e. are able to compute the rank of a matrix. These are typically
233 also the decompositions that behave best in the face of a non-full-rank matrix (which in the square case means a
235 whether they are rank-revealing or not.
237 Rank-revealing decompositions offer at least a rank() method. They can also offer convenience methods such as isInvertible(),
249 Of course, any rank computation depends on the choice of an arbitrary threshold, since practically no
250 floating-point matrix is \em exactly rank-deficient. Eigen picks a sensible default threshold, which depends
253 on your decomposition object before calling rank() or any other method that needs to use such a threshold
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| multiseq_selection.h | 26 * @brief Functions to find elements of a certain global rank in
105 * @brief Splits several sorted sequences at a certain global rank,
113 * @param rank The global rank to partition at.
124 RankType rank,
154 if (rank == N)
164 _GLIBCXX_PARALLEL_ASSERT(rank >= 0);
165 _GLIBCXX_PARALLEL_ASSERT(rank < N);
210 difference_type localrank = rank / l;
262 difference_type skew = rank / (n + 1) - leftsize
[all...] |
| /external/clang/test/SemaObjC/ |
| default-synthesize-2.m | 6 @property(strong) id name, rank, serialNumber;
12 if (self.name && self.rank && self.serialNumber)
16 // @synthesize name, rank, serialNumber;
|
| /external/marisa-trie/lib/ |
| Makefile.am | 26 marisa/rank.h \
|
| /external/marisa-trie/v0_1_5/lib/ |
| Makefile.am | 27 marisa_alpha/rank.h \
|
| /frameworks/base/tests/GridLayoutTest/res/layout/ |
| grid6.xml | 31 <TextView android:text="Rank:"/>
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| common_defs.h | 33 enum MulticlassUpdateType { MAX, RANK };
|
| /external/eigen/blas/ |
| level2_cplx_impl.h | 87 /** ZHPR performs the hermitian rank 1 operation
99 /** ZHPR2 performs the hermitian rank 2 operation
111 /** ZHER performs the hermitian rank 1 operation
155 /** ZHER2 performs the hermitian rank 2 operation
196 /** ZGERU performs the rank 1 operation
234 /** ZGERC performs the rank 1 operation
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /external/chromium/chrome/browser/history/ |
| top_sites_backend.cc | 125 db_->SetPageThumbnail(delta.added[i].url, delta.added[i].rank, Images());
128 db_->UpdatePageRank(delta.moved[i].url, delta.moved[i].rank);
|
| /external/openfst/src/include/fst/ |
| union-find.h | 18 // integers. Implemented using disjoint tree forests with rank
88 vector<int> rank_; // Rank of an element = min. depth in tree.
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| union-find.h | 17 // integers. Implemented using disjoint tree forests with rank
85 vector<int> rank_; // Rank of an element = min. depth in tree.
|
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| BordeauxRanker.java | 32 * For ranking: call scoreSample to the score of the rank
79 // Update the ranker with two samples, sample1 has higher rank than
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| DefaultCorpusRanker.java | 33 * A corpus ranker that uses corpus scores from the shortcut repository to rank
51 * @param corpora Corpora to rank.
|
| /external/ceres-solver/internal/ceres/ |
| corrector.cc | 62 // Hessian gets both the scaling and the rank-1 curvature
76 // newton hessian goes from being a full rank correction to a rank
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/ |
| type_traits | 357 /// rank
359 struct rank
363 struct rank<_Tp[_Size]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
367 struct rank<_Tp[]>
368 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
