Sciweavers

8512 search results - page 127 / 1703
» Computing Theory With Relevance
Sort
View
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
14 years 19 hour ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
CSL
2010
Springer
13 years 9 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
ACL
2012
11 years 10 months ago
Combining Textual Entailment and Argumentation Theory for Supporting Online Debates Interactions
Blogs and forums are widely adopted by online communities to debate about various issues. However, a user that wants to cut in on a debate may experience some difficulties in ext...
Elena Cabrio, Serena Villata
ISMB
1998
13 years 9 months ago
A Statistical Theory of Sequence Alignment with Gaps
Astatistical theory of local alignmentalgorithms with gaps is presented. Both the linear and logarithmic phases, as well as the phase transition separating the two phases, are des...
Dirk Drasdo, Terence Hwa, Michael Lässig
JETAI
1998
56views more  JETAI 1998»
13 years 8 months ago
How minds can be computational systems
The proper treatment of computationalism, as the thesis that cognition is computable, is presented and defended. Some arguments of James H. Fetzer against computationalism are exam...
William J. Rapaport