Sciweavers

43 search results - page 7 / 9
» Solving container loading problems by block arrangement
Sort
View
CANS
2011
Springer
258views Cryptology» more  CANS 2011»
12 years 7 months ago
Fast Computation on Encrypted Polynomials and Applications
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
Payman Mohassel
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
14 years 1 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
FSTTCS
2006
Springer
13 years 11 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
BMCBI
2008
178views more  BMCBI 2008»
13 years 7 months ago
A discriminative method for protein remote homology detection and fold recognition combining Top-n-grams and latent semantic ana
Background: Protein remote homology detection and fold recognition are central problems in bioinformatics. Currently, discriminative methods based on support vector machine (SVM) ...
Bin Liu, Xiaolong Wang, Lei Lin, Qiwen Dong, Xuan ...
INFOCOM
2006
IEEE
14 years 1 months ago
Integrated Intermediate Waveband and Wavelength Switching for Optical WDM Mesh Networks
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
Mengke Li, Byrav Ramamurthy