2251 search results - page 56 / 451 » Geometric Algorithms on CUDA |
SCCC
2005
IEEE
15 years 5 months ago
2005
IEEE
— Fuzzy clustering methods have been widely used in many applications. These methods, including fuzzy k-means and Expectation Maximization, allow an object to be assigned to mult...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
AAECC
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
102
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
FUN
2007
Springer
15 years 6 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...