54 search results - page 5 / 11 » On Approximating the Entropy of Polynomial Mappings |
IPL
2010
13 years 5 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...
RTAS
2006
IEEE
14 years 1 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
PG
2007
IEEE
14 years 1 months ago
2007
IEEE
We introduce QAS, an efficient quadratic approximation of subdivision surfaces which offers a very close appearance compared to the true subdivision surface but avoids recursion,...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...