6045 search results - page 83 / 1209 » Computable Linearizations of Well-partial-orderings |
CRYPTO
2001
Springer
14 years 12 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
MOC
1998
13 years 7 months ago
1998
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
JSC
2010
13 years 6 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
102
click to vote
Tutorial
Set of MATLB tutorials covers the following topics: programming in the language of MATLAB, linear algebra, matrix computations, numerical analysis and linear programming with MATLA...