Sciweavers

13784 search results - page 327 / 2757
» On Computing Functions with Uncertainty
Sort
View
TBILLC
2007
Springer
16 years 23 days ago
A Computational Grammar for Georgian
In this paper, I give an overview of an ongoing project which aims at building a full-scale computational grammar for Georgian in the Lexical Functional Grammar framework and try t...
Paul Meurer
FOCS
1998
IEEE
15 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
FSS
2008
127views more  FSS 2008»
15 years 6 months ago
On the computing power of fuzzy Turing machines
We work with fuzzy Turing machines (FTMs) and we study the relationship between this computational model and classical recursion concepts such as computable functions, recursively...
Benjamín René Callejas Bedregal, San...
ICCV
2003
IEEE
15 years 12 months ago
Computing MAP trajectories by representing, propagating and combining PDFs over groups
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
Paul Smith, Tom Drummond, Kimon Roussopoulos
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
15 years 6 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai