17 search results - page 3 / 4 » An Identification Scheme Based on Sparse Polynomials |
SPAA
2006
ACM
13 years 10 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
TSP
2008
13 years 4 months ago
2008
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
MICCAI
2000
Springer
13 years 8 months ago
2000
Springer
New medical imaging modalities offering multi-valued data, such as phase contrast MRA and diffusion tensor MRI, require general representations for the development of automatized a...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
ICCV
2011
IEEE
12 years 4 months ago
2011
IEEE
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...