Sciweavers

2020 search results - page 376 / 404
» Speeding up Slicing
Sort
View
CASES
2001
ACM
14 years 10 days ago
Storage allocation for embedded processors
In an embedded system, it is common to have several memory areas with different properties, such as access time and size. An access to a specific memory area is usually restricted...
Jan Sjödin, Carl von Platen
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 8 days ago
Oracle8i Index-Organized Table and Its Application to New Domains
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
Jagannathan Srinivasan, Souripriya Das, Chuck Frei...
ISSS
1995
IEEE
161views Hardware» more  ISSS 1995»
14 years 7 days ago
Synthesis of pipelined DSP accelerators with dynamic scheduling
To construct complete systems on silicon, application speci c DSP accelerators are needed to speed up the execution of high throughput DSP algorithms. In this paper, a methodology...
Patrick Schaumont, Bart Vanthournout, Ivo Bolsens,...
JSSPP
1995
Springer
14 years 7 days ago
The ANL/IBM SP Scheduling System
During the past ve years scientists discovered that modern UNIX workstations connected with ethernet and ber networks could provide enough computational performance to compete wit...
David A. Lifka
PODS
1995
ACM
139views Database» more  PODS 1995»
14 years 7 days ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin