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.
Texture compression is an important technique to reduce memory storage and increase rendering speed in graphic processing units (GPUs). To ensure fast decoding and retain random memory access characteristics, the industry standard DXTC compression finds an approximate line segment in color space for each 4×4 block. The idea has been extended to multiline solutions by segmenting the 4×4 block into...
For high resolution spaceborne SAR system, the errors caused by straight trajectory assumption and stop-go approximation cannot be ignored. In this paper, an algorithm is proposed to compensate the above errors. First, a novel modified hyperbolic range equation (MHRE) is introduced to describe the satellite's orbit which is more precise than the traditional hyperbolic range equation (THRE). Then,...
We study the maximal achievable rate R*(n, ∈) for a given block-length n and block error probability o over Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that for a given block-length and error probability, R*(n, ∈) is not monotonic in the channel's coherence time, but there exists a rate maximizing coherence time that optimally trades...
The descriptive power of low-level image features for describing the high-level semantic concepts is limited for content-based image retrieval (CBIR). To reduce this semantic gap and improve retrieval performance of CBIR, a distance metric learning method is proposed which can learn a linear projection to define a distance metric for maximizing mean average precision (MAP). The smooth approximation...
A novel generalized relation is proposed in this paper to discover the knowledge of an interval-valued information system more objective based on the concept of interaction rates, which are the length of the intersection between two objects divided by the length of the first object according to an attribute. So, the two interaction rates between two objects are usually different. The generalized relation...
Secure multi-party computation has been a research focus for more than two decades. The convex hulls problem is a special case of secure multi-party computation. However, the precise convex hulls will certainly expose every vertex and even bring about unfairness. As a result, the practical approximate convex hulls are in need. In this paper, we summarize and discuss the convex hulls problem, and then...
Secure multi-party computation has been a hot research topic of cryptograhy for about two decades, and the convex hulls problem is a special case of it. However, the precise convex hulls will certainly expose all vertexes and even bring about unfairness. Therefore the practical approximate convex hulls are in need. In this paper, we summarize and discuss the convex hulls problem, and then we present...
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.