10988 search results - page 61 / 2198 » Algorithmic Folding Complexity |
109
click to vote
EUROPAR
2000
Springer
15 years 6 months ago
2000
Springer
We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, ge...
111
Voted
ICONIP
2004
15 years 3 months ago
2004
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...
118
click to vote
JSAC
2006
15 years 2 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
113
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
64
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer