Sciweavers

2767 search results - page 19 / 554
» Universal Exponentiation Algorithm
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
k-means requires exponentially many iterations even in the plane
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....
Andrea Vattani
CIKM
2004
Springer
14 years 3 months ago
Unified filtering by combining collaborative filtering and content-based filtering via mixture model and exponential model
Collaborative filtering and content-based filtering are two types of information filtering techniques. Combining these two techniques can improve the recommendation effectiveness....
Luo Si, Rong Jin
COCO
1993
Springer
78views Algorithms» more  COCO 1993»
14 years 2 months ago
The Quantitative Structure of Exponential Time
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
Jack H. Lutz
GECCO
2010
Springer
230views Optimization» more  GECCO 2010»
14 years 2 months ago
Exponential natural evolution strategies
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....
Tobias Glasmachers, Tom Schaul, Yi Sun, Daan Wiers...
CSR
2009
Springer
14 years 4 months ago
New Plain-Exponential Time Classes for Graph Homomorphism
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...
Magnus Wahlström