2745 search results - page 54 / 549 » A fast algorithm for computing large Fibonacci numbers |
150
click to vote
JCP
2008
15 years 3 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
122
Voted
JCT
2007
15 years 3 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
118
click to vote
ESANN
2006
15 years 4 months ago
2006
The training of Emergent Self-organizing Maps (ESOM ) with large datasets can be a computationally demanding task. Batch learning may be used to speed up training. It is demonstrat...
158
Voted
ICMLA
2003
15 years 4 months ago
2003
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
175
Voted
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...