Sciweavers

1399 search results - page 69 / 280
» Multi-party Finite Computations
Sort
View
ICCV
2005
IEEE
14 years 12 months ago
Non-Parametric Self-Calibration
In this paper we develop a theory of non-parametric self-calibration. Recently, schemes have been devised for non-parametric laboratory calibration, but not for selfcalibration. W...
David Nistér, Henrik Stewénius, Etie...
JSC
2002
74views more  JSC 2002»
13 years 9 months ago
Computing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
TCS
2008
13 years 10 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 10 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
AISC
1992
Springer
14 years 2 months ago
A Type-Coercion Problem in Computer Algebra
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
Andreas Weber