Sciweavers

3428 search results - page 192 / 686
» Making the Case
Sort
View
CPM
2005
Springer
206views Combinatorics» more  CPM 2005»
15 years 10 months ago
A Fast Algorithm for Approximate String Matching on Gene Sequences
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
Zheng Liu, Xin Chen, James Borneman, Tao Jiang
FPL
2005
Springer
131views Hardware» more  FPL 2005»
15 years 10 months ago
An Efficient Approach to Hide the Run-Time Reconfiguration from SW Applications
Dynamically reconfigurable logic is becoming an important design unit in SoC system. A method to make the reconfiguration management transparent to software applications is requir...
Yang Qu, Juha-Pekka Soininen, Jari Nurmi
INFOVIS
2003
IEEE
15 years 9 months ago
Interactive Hierarchical Dimension Ordering, Spacing and Filtering for Exploration of High Dimensional Datasets
Large numbers of dimensions not only cause clutter in multidimensional visualizations, but also make it difficult for users to navigate the data space. Effective dimension manage...
Jing Yang, Wei Peng, Matthew O. Ward, Elke A. Rund...
ISORC
2002
IEEE
15 years 9 months ago
Packaging Quality of Service Control Behaviors for Reuse
Two limitations of the current implementations of adaptive QoS behaviors are complexity associated with inserting them into common application contexts and lack of reusability acr...
Richard E. Schantz, Joseph P. Loyall, Michael Atig...
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
15 years 8 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...