2899 search results - page 92 / 580 » Dynamic Trees in Practice |
AOSD
2009
ACM
14 years 29 days ago
2009
ACM
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...
MICRO
2006
IEEE
13 years 9 months ago
2006
IEEE
In the past few years, several research works have demonstrated that sampling can drastically speed up architecture simulation, and several of these sampling techniques are already...
CASES
2008
ACM
13 years 11 months ago
2008
ACM
The Field Programmable Compressor Tree (FPCT) is a programmable compressor tree (e.g., a Wallace or Dadda Tree) intended for integration in an FPGA or other reconfigurable device....
ECR
2002
13 years 8 months ago
2002
Many new multimedia applications involve dynamic multiple participants, have stringent endto-end delay requirement and consume large amount of network resources. In this paper, we...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...