Sciweavers

359 search results - page 26 / 72
» On Complexity of Easy Predictable Sequences
Sort
View
BMCBI
2006
148views more  BMCBI 2006»
15 years 6 months ago
Predicting Class II MHC-Peptide binding: a kernel based approach using similarity scores
Background: Modelling the interaction between potentially antigenic peptides and Major Histocompatibility Complex (MHC) molecules is a key step in identifying potential T-cell epi...
Jesper Salomon, Darren R. Flower
DAC
1997
ACM
15 years 10 months ago
Hardware/Software Co-Simulation in a VHDL-Based Test Bench Approach
Novel test bench techniques are required to cope with a functional test complexity which is predicted to grow much more strongly than design complexity. Our test bench approach at...
Matthias Bauer, Wolfgang Ecker
AAAI
2007
15 years 8 months ago
A Randomized String Kernel and Its Application to RNA Interference
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
Shibin Qiu, Terran Lane, Ljubomir J. Buturovic
NIME
2001
Springer
205views Music» more  NIME 2001»
15 years 10 months ago
Musical Trinkets
Passive RF Tagging can provide an attractive medium for development of free-gesture musical interfaces. This was initially explored in our Musical Trinkets installation, which use...
Joseph A. Paradiso
ECCC
2000
113views more  ECCC 2000»
15 years 5 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich