Sciweavers

746 search results - page 10 / 150
» Fast (Structured) Newton Computations
Sort
View
ICICS
2003
Springer
14 years 26 days ago
Secure Route Structures for the Fast Dispatch of Large-Scale Mobile Agents
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
Yan Wang 0002, Chi-Hung Chi, Tieyan Li
ICIP
2000
IEEE
14 years 9 months ago
Computationally Scalable Partial Distance Based Fast Search Motion Estimation
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
Krisda Lengwehasatit, Antonio Ortega
SIGPRO
2008
89views more  SIGPRO 2008»
13 years 7 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
COMPLIFE
2005
Springer
14 years 1 months ago
Fast and Accurate Structural RNA Alignment by Progressive Lagrangian Optimization
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignmen...
Markus Bauer, Gunnar W. Klau, Knut Reinert