4372 search results - page 150 / 875 » Algorithmic Theories of Everything |
CL
2012
Springer
11 years 11 months ago
2012
Springer
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
LFCS
2007
Springer
14 years 3 months 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...
ESWA
2008
13 years 9 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...
APPROX
2009
Springer
14 years 3 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...
ICA3PP
2010
Springer
14 years 1 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...