Sciweavers

580 search results - page 42 / 116
» Building a Family of Compilers
Sort
View
BIBE
2007
IEEE
147views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
A New Alignment-Independent Algorithm for Clustering Protein Sequences
—The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important, the challenge is to identify subfamilies of evolut...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski
COLT
2008
Springer
13 years 9 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer
ICS
2001
Tsinghua U.
14 years 4 days ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
EUROPKI
2009
Springer
13 years 5 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...
BMCBI
2010
144views more  BMCBI 2010»
13 years 7 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...