1449 search results - page 27 / 290 » Self-Randomized Exponentiation Algorithms |
95
Voted
COMPGEOM
2009
ACM
15 years 5 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
106
Voted
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
Collaborative filtering and content-based filtering are two types of information filtering techniques. Combining these two techniques can improve the recommendation effectiveness....
107
Voted
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
The family of natural evolution strategies (NES) offers a principled approach to real-valued evolutionary optimization by following the natural gradient of the expected fitness....
94
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
81
Voted
COCO
2008
Springer
15 years 2 months ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...