Sciweavers

858 search results - page 164 / 172
» One Is Enough!
Sort
View
BMCBI
2007
141views more  BMCBI 2007»
13 years 8 months ago
Using structural motif descriptors for sequence-based binding site prediction
Background: Many protein sequences are still poorly annotated. Functional characterization of a protein is often improved by the identification of its interaction partners. Here, ...
Andreas Henschel, Christof Winter, Wan Kyu Kim, Mi...
IEICET
2006
79views more  IEICET 2006»
13 years 8 months ago
System LSI: Challenges and Opportunities
End of CMOS scaling has been discussed in many places since the late 90's. Even if the end of CMOS scaling is irrelevant, it is for sure that we are facing a turning point in...
Tadahiro Kuroda
IJFCS
2006
130views more  IJFCS 2006»
13 years 8 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 8 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 8 months ago
Using decision problems in public key cryptography
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
Vladimir Shpilrain, Gabriel Zapata