Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
Hemant Ishwaran, Udaya B. Kogalur, Xi Chen, Andy J...
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
Aris Anagnostopoulos, Ravi Kumar, Mohammad Mahdian...
Fingerprint classification reduces the searching time of an automated fingerprint identification system. Since fingerprints have properties of intra-class diversities and inter-cla...
The characteristic methods are known to be very efficient for convection-diffusion problems including the Navier-Stokes equations. Convergence is established when the integrals ar...