Sciweavers

943 search results - page 44 / 189
» How should data structures and algorithms be taught
Sort
View
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
15 years 3 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
COLING
2010
14 years 4 months ago
Active Deep Networks for Semi-Supervised Sentiment Classification
This paper presents a novel semisupervised learning algorithm called Active Deep Networks (ADN), to address the semi-supervised sentiment classification problem with active learni...
Shusen Zhou, Qingcai Chen, Xiaolong Wang
TMM
2002
130views more  TMM 2002»
14 years 9 months ago
Computable scenes and structures in films
In this paper, we present a computational scene model and also derive novel algorithms for computing audio and visual scenes and within-scene structures in films. We use constraint...
Hari Sundaram, Shih-Fu Chang
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
15 years 1 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
CSB
2003
IEEE
176views Bioinformatics» more  CSB 2003»
15 years 3 months ago
3D Structural Homology Detection via Unassigned Residual Dipolar Couplings
Recognition of a protein’s fold provides valuable information about its function. While many sequence-based homology prediction methods exist, an important challenge remains: tw...
Christopher James Langmead, Bruce Randall Donald