Sciweavers

2887 search results - page 53 / 578
» Name Generation and Linearity
Sort
View
VIP
2000
15 years 7 months ago
Use of Series Parallel Digraph Analysis in Generating Instructions for Multiple Users
Series Parallel (SP) digraphs are a common method of representing instructions with partially ordered actions, but not always an ideal one, as relationships among groups of action...
Margaret Mitchell
CN
2002
100views more  CN 2002»
15 years 5 months ago
Context-based navigation in the Web by means of dynamically generated guided tours
A key advantage of hypermedia systems such as the Web is that the user is able to navigate through the information space in a non-linear fashion. He can explore the interlinked do...
Wilfried Lemahieu
HPCC
2007
Springer
15 years 9 months ago
Concurrent Number Cruncher: An Efficient Sparse Linear Solver on the GPU
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
Luc Buatois, Guillaume Caumon, Bruno Lévy
SIAMIS
2010
190views more  SIAMIS 2010»
15 years 20 days ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
PC
2002
118views Management» more  PC 2002»
15 years 5 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin