A challenge for data imputation is the lack of knowledge. In this paper, we attempt to address this challenge by involving extra knowledge from web. To achieve high-performance web-based imputation, we use the dependency, i.e. FDs and CFDs, to impute as many as possible values automatically and fill in the other missing values with the minimal access of web, whose cost is relatively large. To m...

We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in order to reduce the computational cost of prediction while maintaining predictio...

In this paper we deal with planning and optimization of survivable WDM networks. We investigate routing and planning of working and spare capacity for Wavelength Path and Virtual Wavelength Path networks. Models for recommendation of k diversified paths and diversified path restoration for WDM networks are presented. The results show the dependency of spare capacity cost from number of k recomm...

The effect was two-fold: Firstly, it increased the number of market exits (bankruptcies) and the number of consolidations (mergers and acquisitions). This decreased the number of firms, and increasing the level of concentration. Secondly, it changed the industry’s investment strategies, from investing in new knowledge and technology, and innovation, towards cost-cutting and outsourcing. This de...

One way of recovering watermarks in geometrically distorted images is by performing a geometrical search. In addition to the computational cost required for this method, this paper considers the more important problem of false positives. The maximal number of detections that can be performed in a geometrical search is bounded by the maximum false positive detection probability required by the w...

In recent years several techniques for exceeding the program’s data-flow constraints have been proposed. These include value prediction, instruction reuse, and dependency redirection. In this paper we show how they can be regarded as one universal method of performing what we term result reuse. We study in depth the dependency redirection derivative and propose several hardware schemes to accom...

Application-level multi-tenancy is an architectural design principle for Software-as-a-Service applications to enable the hosting of multiple customers (or tenants) by a single application instance. Despite the operational cost and maintenance benefits of application-level multitenancy, the current middleware component models for multi-tenant application design are inflexible with respect to pr...

The numerical computation of the exponentiation of a real matrix has been intensively studied. The main objective of a good numerical method is to deal with round-off errors and computational cost. The situation is more complicated when dealing with interval matrices exponentiation: Indeed, the main problem will now be the dependency loss of the different occurrences of the variables due to int...

In plan reuse, refitting is the process of modifying an existing plan to make it applicable to a new problem situation. An efficient refitting strategy needs to be conservative, i.e., it should minimally modify the ex­ isting plan to fit it to the new problem situation. In this paper we present techniques for conservative refitting control by utilizing the annotated dependency structures of an ...