853 search results - page 11 / 171 » Are many small sets explicitly small |
187
click to vote
HSNMC
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
147
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
149
click to vote
JCT
2007
15 years 5 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 → ∞,...
163
click to vote
APN
2004
Springer
15 years 11 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
209
click to vote
ICML
2005
IEEE
16 years 6 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...