5995 search results - page 421 / 1199 » Algorithmic Game Theory |
195
click to vote
ESWA
2008
15 years 7 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...
196
click to vote
APPROX
2009
Springer
16 years 2 months 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...
172
click to vote
ICA3PP
2010
Springer
16 years 15 days 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...
196
click to vote
TOC
2008
15 years 7 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 ...
249
click to vote
MOBIHOC
2008
ACM
16 years 7 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...