Sciweavers

2192 search results - page 23 / 439
» Algorithms for Challenging Motif Problems
Sort
View
JCB
2000
71views more  JCB 2000»
13 years 7 months ago
Structure Comparison and Structure Patterns
This article investigates aspects of pairwise and multiple structure comparison, and the problem of automatically discover common patterns in a set of structures. Descriptions and...
Ingvar Eidhammer, Inge Jonassen, William R. Taylor
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
12 years 8 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
WABI
2004
Springer
14 years 1 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm
FUIN
2010
268views more  FUIN 2010»
13 years 2 months ago
Boruta - A System for Feature Selection
Machine learning methods are often used to classify objects described by hundreds of attributes; in many applications of this kind a great fraction of attributes may be totally irr...
Miron B. Kursa, Aleksander Jankowski, Witold R. Ru...
CSL
2010
Springer
13 years 8 months ago
Monaural speech separation and recognition challenge
Robust speech recognition in everyday conditions requires the solution to a number of challenging problems, not least the ability to handle multiple sound sources. The specific ca...
Martin Cooke, John R. Hershey, Steven J. Rennie