2843 search results - page 111 / 569 » Interpolation by geometric algorithm |
144
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
127
click to vote
SCCC
2005
IEEE
15 years 9 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...
121
Voted
WAW
2004
Springer
15 years 8 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, ...
101
click to vote
AAECC
2004
Springer
15 years 3 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 ...
139
click to vote
GECCO
2009
Springer
15 years 8 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...