Sciweavers

209 search results - page 18 / 42
» Using Run-Time Data for Program Comprehension
Sort
View
CLUSTER
2005
IEEE
14 years 1 months ago
A pipelined data-parallel algorithm for ILP
The amount of data collected and stored in databases is growing considerably for almost all areas of human activity. Processing this amount of data is very expensive, both humanly...
Nuno A. Fonseca, Fernando M. A. Silva, Víto...
IEEEIAS
2007
IEEE
14 years 2 months ago
Metrics-based Evaluation of Slicing Obfuscations
An obfuscation aims to transform a program, without affecting its functionality, so that some secret data within the program can be hidden for as long as possible from an adversar...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
ASAP
2007
IEEE
136views Hardware» more  ASAP 2007»
14 years 2 months ago
0/1 Knapsack on Hardware: A Complete Solution
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
K. Nibbelink, S. Rajopadhye, R. McConnell
CPHYSICS
2008
96views more  CPHYSICS 2008»
13 years 8 months ago
Moment distributions of clusters and molecules in the adiabatic rotor model
We present a Fortran program to compute the distribution of dipole moments of free particles for use in analyzing molecular beams experiments that measure moments by deflection in...
G. E. Ballentine, G. F. Bertsch, N. Onishi, K. Yab...
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 9 months ago
Stop Chasing Trends: Discovering High Order Models in Evolving Data
Abstract-- Many applications are driven by evolving data -patterns in web traffic, program execution traces, network event logs, etc., are often non-stationary. Building prediction...
Shixi Chen, Haixun Wang, Shuigeng Zhou, Philip S. ...