71228 search results - page 100 / 14246 » Algorithms |
113
click to vote
ISSAC
2005
Springer
15 years 7 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
COLT
2003
Springer
15 years 6 months ago
2003
Springer
A general class of no-regret learning algorithms, called no-Φ-regret learning algorithms, is defined which spans the spectrum from no-external-regret learning to no-internal-reg...
110
click to vote
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
117
click to vote
ESA
1997
Springer
15 years 5 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
We study how different prediction update algorithms influence the performance of XCSF. We consider three classical parameter estimation algorithms (NLMS, RLS, and Kalman filter) a...