8728 search results - page 80 / 1746 » On Reduct Construction Algorithms |
76
Voted
EOR
2006
15 years 20 days ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
91
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...
116
Voted
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such ...
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...
97
Voted
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...