801 search results - page 85 / 161 » Minimal Locked Trees |
80
Voted
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
ESA
1999
Springer
15 years 2 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
105
click to vote
IJCAI
1997
14 years 11 months ago
1997
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
150
click to vote
SADM
2011
14 years 4 months ago
2011
: 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...
IPL
2010
14 years 8 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...