Sciweavers

386 search results - page 69 / 78
» Interval Valued QL-Implications
Sort
View
DAGSTUHL
2007
13 years 9 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
APVIS
2009
13 years 8 months ago
Visibility-driven transfer functions
Direct volume rendering is an important tool for visualizing complex data sets. However, in the process of generating 2D images from 3D data, information is lost in the form of at...
Carlos D. Correa, Kwan-Liu Ma
BMCBI
2010
115views more  BMCBI 2010»
13 years 7 months ago
Integration of multiple data sources to prioritize candidate genes using discounted rating system
Background: Identifying disease gene from a list of candidate genes is an important task in bioinformatics. The main strategy is to prioritize candidate genes based on their simil...
Yongjin Li, Jagdish Chandra Patra
COR
2006
97views more  COR 2006»
13 years 7 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
CN
2004
122views more  CN 2004»
13 years 7 months ago
Group rekeying with limited unicast recovery
In secure group communications, a key server can deliver a "grouporiented" rekey message [22] to a large number of users efficiently using multicast. For reliable delive...
X. Brian Zhang, Simon S. Lam, Dong-Young Lee