In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
Analyzing a program run can provide important insights about its correctness. Dynamic analysis of complex correctness properties, however, usually results in significant run-time ...
Matthew B. Dwyer, Alex Kinneer, Sebastian G. Elbau...
This paper addresses the problem of porting distributed parallel applications to the Grid. One of the challenges we address is the change from static homogeneous cluster environmen...
Vladimir Korkhov, Valeria V. Krzhizhanovskaya, Pet...
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...