Sciweavers

953 search results - page 101 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
13 years 8 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
VLDB
2005
ACM
152views Database» more  VLDB 2005»
14 years 8 months ago
Composing, optimizing, and executing plans for bioinformatics web services
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...
Snehal Thakkar, José Luis Ambite, Craig A. Knoblo...
BMCBI
2010
102views more  BMCBI 2010»
13 years 3 months ago
Predicting protein-protein interactions in unbalanced data using the primary structure of proteins
Background: Elucidating protein-protein interactions (PPIs) is essential to constructing protein interaction networks and facilitating our understanding of the general principles ...
Chi-Yuan Yu, Lih-Ching Chou, Darby Tien-Hao Chang
ICCV
2011
IEEE
12 years 8 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...
IACR
2011
212views more  IACR 2011»
12 years 7 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...