6045 search results - page 181 / 1209 » Computable Linearizations of Well-partial-orderings |
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
A major limitation of Brain-Computer Interfaces (BCI) is their long calibration time, as much data from the user must be collected in order to tune the BCI for this target user. I...
CAP
2010
13 years 3 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
ESA
2011
Springer
12 years 8 months ago
2011
Springer
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
IACR
2011
12 years 7 months ago
2011
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...