Sciweavers

7264 search results - page 93 / 1453
» A multiplicative up-propagation algorithm
Sort
View
CORR
2002
Springer
102views Education» more  CORR 2002»
14 years 9 months ago
Tight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An
Stavros G. Kolliopoulos, Neal E. Young
ANTS
2008
Springer
93views Algorithms» more  ANTS 2008»
14 years 11 months ago
Faster Multiplication in GF(2)[x]
Abstract. In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook...
Richard P. Brent, Pierrick Gaudry, Emmanuel Thom&e...
TEC
2010
112views more  TEC 2010»
14 years 4 months ago
Population-Based Algorithm Portfolios for Numerical Optimization
In this paper, we consider the scenario that a population-based algorithm is applied to a numerical optimization problem and a solution needs to be presented within a given time bu...
Fei Peng, Ke Tang, Guoliang Chen, Xin Yao
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 3 months ago
Maximum Matchings in Planar Graphs via Gaussian Elimination
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
Marcin Mucha, Piotr Sankowski
AAAI
2012
13 years 6 days ago
Online Kernel Selection: Algorithms and Evaluations
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
Tianbao Yang, Mehrdad Mahdavi, Rong Jin, Jinfeng Y...