Sciweavers

12264 search results - page 406 / 2453
» Analysis of the rubberband algorithm
Sort
View
COLT
2008
Springer
15 years 8 months ago
More Efficient Internal-Regret-Minimizing Algorithms
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...
Amy R. Greenwald, Zheng Li, Warren Schudy
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 7 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
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...
Johan M. M. van Rooij, Hans L. Bodlaender
KAIS
2008
79views more  KAIS 2008»
15 years 6 months ago
Top 10 algorithms in data mining
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...
Xindong Wu, Vipin Kumar, J. Ross Quinlan, Joydeep ...
NA
2008
144views more  NA 2008»
15 years 6 months ago
Another hybrid conjugate gradient algorithm for unconstrained optimization
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...
Neculai Andrei
MTA
2006
195views more  MTA 2006»
15 years 6 months ago
An efficient and robust algorithm for 3D mesh segmentation
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...
Lijun Chen 0003, Nicolas D. Georganas