12265 search results - page 406 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
187
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
184
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
193
click to vote
KAIS
2008
15 years 6 months ago
2008
This paper presents the top 10 data mining algorithms identified by the IEEE International Conference on Data Mining (ICDM) in December 2006: C4.5, k-Means, SVM, Apriori, EM, Page...
162
click to vote
NA
2008
15 years 6 months ago
2008
Another hybrid conjugate gradient algorithm is subject to analysis. The parameter k is computed as a convex combination of HS k (Hestenes-Stiefel) and DY k (Dai-Yuan) algorithms, i...
171
click to vote
MTA
2006
15 years 6 months ago
2006
Abstract This paper presents an efficient and robust algorithm for 3D mesh segmentation. Segmentation is one of the main areas of 3D object modeling. Most segmentation methods deco...