2430 search results - page 411 / 486 » Computing Tutte Polynomials |
101
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
108
click to vote
ECCC
2006
15 years 2 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
IJAR
2008
15 years 2 months ago
2008
While quantitative probabilistic networks (QPNs) allow the expert to state influences between nodes in the network as influence signs, rather than conditional probabilities, infer...
118
click to vote
IOR
2008
15 years 2 months ago
2008
Estimating the arrival rate function of a non-homogeneous Poisson process based on observed arrival data is a problem naturally arising in many applications. Cubic spline function...
145
Voted
IJCV
2006
15 years 2 months ago
2006
We present an algebraic geometric approach to 3-D motion estimation and segmentation of multiple rigid-body motions from noise-free point correspondences in two perspective views. ...