Sciweavers

921 search results - page 65 / 185
» Expressing Computational Complexity in Constructive Type The...
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
CICLING
2003
Springer
14 years 1 months ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen
BMCBI
2006
142views more  BMCBI 2006»
13 years 8 months ago
Correlated fragile site expression allows the identification of candidate fragile genes involved in immunity and associated with
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
Angela Re, Davide Corà, Alda Maria Puliti, ...
ICTAI
1994
IEEE
14 years 2 hour ago
A Knowledge Representation System for Integration of General and Case-Specific Knowledge
Combining various knowledge types - and reasoning methods - in knowledge-based systems is a challenge to the knowledge representation task. The paper describes an object-oriented,...
Agnar Aamodt
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
14 years 8 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...