Sciweavers

4342 search results - page 482 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
GD
2000
Springer
15 years 11 months ago
A Fast Multi-scale Method for Drawing Large Graphs
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
David Harel, Yehuda Koren
GECCO
2004
Springer
166views Optimization» more  GECCO 2004»
16 years 1 months ago
Evolutionary Ensemble for Stock Prediction
We propose a genetic ensemble of recurrent neural networks for stock prediction model. The genetic algorithm tunes neural networks in a two-dimensional and parallel framework. The ...
Yung-Keun Kwon, Byung Ro Moon
JACM
2010
111views more  JACM 2010»
15 years 6 months ago
Finding a maximum matching in a sparse random graph in O(n) expected time
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ICIP
2003
IEEE
16 years 9 months ago
Near-optimal multipath streaming of H.264 using reference frame selection
New video codink standards such as H.264 offer the flexibility to select from a number of reference frames for motion-estimation for a given predicted frame. In this paper, we pro...
Gene Cheung
SMI
2006
IEEE
121views Image Analysis» more  SMI 2006»
16 years 1 months ago
Minimum Ratio Contours on Surface Meshes
We present a novel approach for discretely optimizing contours on the surface of a triangle mesh. This is achieved through the use of a minimum ratio cycle (MRC) algorithm, where ...
Andrew Clements, Hao Zhang 0002