Sciweavers

8413 search results - page 255 / 1683
» Ordering Problem Subgoals
Sort
View
124
Voted
MST
2011
207views Hardware» more  MST 2011»
14 years 8 months ago
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
192
Voted
SADM
2011
14 years 8 months ago
Random survival forests for high-dimensional data
: 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...
114
Voted
TCS
2011
14 years 8 months ago
Sorting and selection on dynamic data
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...
129
Voted
IDA
2010
Springer
14 years 8 months ago
Fingerprint classification based on subclass analysis using multiple templates of support vector machines
Fingerprint classification reduces the searching time of an automated fingerprint identification system. Since fingerprints have properties of intra-class diversities and inter-cla...
Jun-Ki Min, Jin-Hyuk Hong, Sung-Bae Cho
96
Voted
JSCIC
2010
97views more  JSCIC 2010»
14 years 8 months ago
Finite Element Characteristic Methods Requiring no Quadrature
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...
Olivier Pironneau