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.
The conventional crowdsourcing paradigm requires an explicit task description and payment scheme. Requesters can then easily determine whether the crowdsourced results are satisfactory, and workers will have a fairly clear expectation of the monetary reward once the task is accomplished. However, such a paradigm becomes problematic when it is applied to Object Identification (OI) tasks. First, for...
Most Online Social Networks (OSNs) allow registered members to leave comments on particular entities. An entity can either be a person, a location, or a product. These comments have already become an important reference for many people in the daily life. However, a popular entity usually receives an extensive number of comments and it has become infeasible for users to read through all of them. In...
This paper proposes the VisibilityCluster algorithm for efficient visibility approximation and representation in many-light rendering. By carefully clustering lights and shading points, we can construct a visibility matrix that exhibits good local structures due to visibility coherence of nearby lights and shading points. Average visibility can be efficiently estimated by exploiting the sparse structure...
In sequencing-by-synthesis systems, determining the order of nucleotides of a DNA fragment can be cast as an ML sequence detection (MLSD) problem. Solving it via exhaustive search is prohibitive even for relatively short DNA sequences. Symbol-by-symbol and partial-MLSD solutions are computationally feasible but sacrifice the optimal performance. In this paper, we modify the so-called sphere decoding...
In this paper, an efficient algorithm for the computation of Tate pairing on general curves is presented. Our approach is to change the binary representation of the involved integer to its non-adjacent form at first, and then pre-organize this form to make further improvement on its efficiency. We also show this algorithm has better performance than BMX and LHC algorithms.
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.