The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents a method to reconstruct the surface reflectance of objects from images. For objects with spatially-varying materials, we assume that each point can be represented as a weighted sum of several basic materials. First, a cluster algorithm is applied to automatically compute the number of basic materials. Then, the weight map and parameters of the reflectance model are iteratively...
In the MDD and MDA approaches, models become the primary artifacts of the development process. Therefore, assessment of the correctness of such models is a key issue to ensure the quality of the final application. In that sense, this paper presents an automatic method that uses the Constraint Programming paradigm to verify UML class diagrams extended with OCL constraints. In our approach, both class...
This paper addresses adaptive channel estimation for time-varying mobile wireless channels with nonstationary statistics. We presents a reduced complexity adaptive channel estimator based on a set membership filtering approach known as the Optimal Bounding Ellipsoid (OBE) algorithm. To exploit time and frequency domain correlation properties of the channel in an efficient low-complexity way, we allow...
We establish new upper bounds on the complexity of several "rectangle" problems. Our results include, for instance, optimal algorithms for range counting and rectangle searching in two dimensions. These involve linear space implementations of range trees and segment trees. The algorithms we give are simple and practical; they can be dynamized and taken into higher dimensions. Also of interest...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.