159 search results - page 13 / 32 » nn 2006 |
COMBINATORICS
2002
13 years 7 months ago
2002
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
NA
2007
13 years 7 months ago
2007
: The purpose of this paper is to evaluate the limit γ(a) of the sequence 1 a + 1 a + 1 + · · · + 1 a + n − 1 − ln a + n − 1 a n∈N , where a ∈ (0, +∞). We give some...
IJON
2007
13 years 7 months ago
2007
In this paper, a global methodology for the long-term prediction of time series is proposed. This methodology combines direct prediction strategy and sophisticated input selection...
JCO
2010
13 years 6 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
VLDB
2006
ACM
14 years 7 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...