Sciweavers

6546 search results - page 406 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
190
Voted
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
15 years 7 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
TNN
1998
111views more  TNN 1998»
15 years 6 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
EUROPAR
2010
Springer
15 years 7 months ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...
172
Voted
IPPS
1998
IEEE
15 years 11 months ago
Design, Implementation and Evaluation of Parallel Pipelined STAP on Parallel Computers
This paper presents performance results for the design and implementation of parallel pipelined Space-Time Adaptive Processing (STAP) algorithms on parallel computers. In particul...
Alok N. Choudhary, Wei-keng Liao, Donald Weiner, P...
DOLAP
2004
ACM
16 years 6 days ago
Experimental evidence on partitioning in parallel data warehouses
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
Pedro Furtado