Sciweavers

12052 search results - page 188 / 2411
» computer 2010
Sort
View
JOLLI
2010
84views more  JOLLI 2010»
14 years 9 months ago
Exploring Feature Agreement in French with Parallel Pregroup Computations
One way of coping with agreement of features in French is to perform two parallel computations, one in the free pregroup of syntactic types, the other in that of feature types. Tec...
Joachim Lambek
NDJFL
2010
14 years 5 months ago
Decidability and Computability of Certain Torsion-Free Abelian Groups
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
FOCS
2010
IEEE
14 years 8 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
JMIV
2010
78views more  JMIV 2010»
14 years 5 months ago
Unified Computation of Strict Maximum Likelihood for Geometric Fitting
A new numerical scheme is presented for strictly computing maximum likelihood (ML) of geometric fitting problems. Intensively studied in the past are those methods that first tran...
Kenichi Kanatani, Yasuyuki Sugaya
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 9 months ago
Computational Complexity of Iterated Maps on the Interval
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
Christoph Spandl