Sciweavers

114 search results - page 12 / 23
» Recognizing Balanceable Matrices
Sort
View
124
Voted
ISMB
2000
15 years 1 months ago
Accelerating Protein Classification Using Suffix Trees
Position-specific scoring matrices have been used extensively to recognize highly conserved protein regions. We present a method for accelerating these searches using a suffix tre...
Bogdan Dorohonceanu, Craig G. Nevill-Manning
82
Voted
EUROPAR
2007
Springer
15 years 5 months ago
Program Behavior Characterization Through Advanced Kernel Recognition
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs (from now on, computational kernel...
Manuel Arenaz, Juan Touriño, Ramon Doallo
KAIS
2006
111views more  KAIS 2006»
14 years 11 months ago
Real-time classification of variable length multi-attribute motions
Multi-attribute motion data can be generated in many applications/ devices, such as motion capture devices and animations. It can have dozens of attributes, thousands of rows, and ...
Chuanjun Li, Latifur Khan, Balakrishnan Prabhakara...
99
Voted
IPPS
2005
IEEE
15 years 5 months ago
Reducing Power with Performance Constraints for Parallel Sparse Applications
Sparse and irregular computations constitute a large fraction of applications in the data-intensive scientific domain. While every effort is made to balance the computational wor...
Guangyu Chen, Konrad Malkowski, Mahmut T. Kandemir...
110
Voted
HPCN
1997
Springer
15 years 3 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher