Sciweavers

3630 search results - page 74 / 726
» Fast Marching Methods
Sort
View
GD
2006
Springer
14 years 1 months ago
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
Ulrik Brandes, Christian Pich
ASPDAC
2008
ACM
100views Hardware» more  ASPDAC 2008»
14 years 6 hour ago
Routability driven modification method of monotonic via assignment for 2-layer Ball Grid Array packages
Ball Grid Array packages in which I/O pins are arranged in a grid array pattern realize a number of connections between chips and a printed circuit board, but it takes much time in...
Yoichi Tomioka, Atsushi Takahashi
ICIP
2009
IEEE
14 years 11 months ago
Discrete Curvature Calculation For Fast Level Set Segmentation
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...
ICT
2004
Springer
121views Communications» more  ICT 2004»
14 years 3 months ago
A New Distributed Power Control Algorithm Based on a Simple Prediction Method
Abstract. Most distributed power control algorithms have been proposed assuming constant interference and constant path gain. These considerations may result in lower performance g...
R. A. de Oliveira Neto, F. de S. Chaves, Francisco...
CVPR
2007
IEEE
15 years 6 days ago
Saliency Detection: A Spectral Residual Approach
The ability of human visual system to detect visual saliency is extraordinarily fast and reliable. However, computational modeling of this basic intelligent behavior still remains...
Xiaodi Hou, Liqing Zhang