Sciweavers

5523 search results - page 231 / 1105
» Improving application performance with hardware data structu...
Sort
View
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
15 years 5 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
WMPI
2004
ACM
15 years 9 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
JCP
2007
154views more  JCP 2007»
15 years 4 months ago
Partially Reconfigurable Vector Processor for Embedded Applications
—Embedded systems normally involve a combination of hardware and software resources designed to perform dedicated tasks. Such systems have widely crept into industrial control, a...
Muhammad Z. Hasan, Sotirios G. Ziavras
ITC
2003
IEEE
214views Hardware» more  ITC 2003»
15 years 9 months ago
ATPG Padding And ATE Vector Repeat Per Port For Reducing Test Data Volume
This paper presents an approach for reducing the test data volume that has to be stored in ATE vector memory for IC manufacturing testing. We exploit the capabilities of present A...
Harald P. E. Vranken, Friedrich Hapke, Soenke Rogg...
UAI
1997
15 years 5 months ago
Sequential Update of Bayesian Network Structure
There is an obvious need for improving the performance and accuracy of a Bayesian network as new data is observed. Because of errors in model construction and changes in the dynam...
Nir Friedman, Moisés Goldszmidt