2766 search results - page 64 / 554 » Algorithms for trigonometric polynomials |
137
Voted
ACL
1990
15 years 1 months ago
1990
In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
122
Voted
NCA
2008
IEEE
15 years 21 days ago
2008
IEEE
Three extensions to the Kernel-AdaTron training algorithm for Support Vector Machine classifier learning are presented. These extensions allow the trained classifier to adhere more...
130
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
127
Voted
CANS
2011
Springer
14 years 22 days ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
109
click to vote
SODA
1998
ACM
15 years 2 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...