Sciweavers

330 search results - page 14 / 66
» Effective Complexity and its Relation to Logical Depth
Sort
View
EACL
2006
ACL Anthology
13 years 9 months ago
Investigating a Generic Paraphrase-Based Approach for Relation Extraction
Unsupervised paraphrase acquisition has been an active research field in recent years, but its effective coverage and performance have rarely been evaluated. We propose a generic ...
Lorenza Romano, Milen Kouylekov, Idan Szpektor, Id...
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
14 years 16 hour ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
14 years 1 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
DATE
2005
IEEE
143views Hardware» more  DATE 2005»
14 years 1 months ago
Energy Bounds for Fault-Tolerant Nanoscale Designs
- The problem of determining lower bounds for the energy cost of a given nanoscale design is addressed via a complexity theory-based approach. This paper provides a theoretical fra...
Diana Marculescu
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
13 years 11 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin