1399 search results - page 4 / 280 » New Algorithms for k-Center and Extensions |
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In this paper, two general algorithms for the automatic generation of instruction-set extensions are presented. The basic instruction set of a reconfigurable architectu...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
In this paper, we survey the current state-ofart models for structured learning problems, including Hidden Markov Model (HMM), Conditional Random Fields (CRF), Averaged Perceptron...
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
TOC
2010
13 years 2 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Over the years, many improvements and refinements of the backpropagation learning algorithm have been reported. In this paper, a new adaptive penalty-based learning ex...