4403 search results - page 153 / 881 » Galois Theory of Algorithms |
182
click to vote
LFCS
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
158
click to vote
ESWA
2008
15 years 6 months ago
2008
Clustering is an important function in data mining. Its typical application includes the analysis of consumer's materials. Adaptive resonance theory network (ART) is very pop...
161
click to vote
APPROX
2009
Springer
16 years 29 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
145
click to vote
ICA3PP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
171
click to vote
TOC
2008
15 years 6 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...