Sciweavers

8728 search results - page 80 / 1746
» On Reduct Construction Algorithms
Sort
View
EOR
2006
70views more  EOR 2006»
13 years 9 months ago
Heuristics for matrix bandwidth reduction
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...
Andrew Lim, Brian Rodrigues, Fei Xiao
COMPGEOM
2009
ACM
14 years 3 months ago
Persistent cohomology and circular coordinates
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...
Vin de Silva, Mikael Vejdemo-Johansson
CPAIOR
2008
Springer
13 years 10 months ago
Gap Reduction Techniques for Online Stochastic Project Scheduling
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such ...
Grégoire Dooms, Pascal Van Hentenryck
ICML
2006
IEEE
14 years 9 months ago
Semi-supervised nonlinear dimensionality reduction
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...
Xin Yang, Haoying Fu, Hongyuan Zha, Jesse L. Barlo...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 3 months ago
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
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...
Bilel Derbel, Cyril Gavoille, David Peleg