Sciweavers

2631 search results - page 507 / 527
» Less is More
Sort
View
BMCBI
2007
153views more  BMCBI 2007»
13 years 7 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
IOR
2008
128views more  IOR 2008»
13 years 7 months ago
Promised Lead-Time Contracts Under Asymmetric Information
We study the important problem of how a supplier should optimally share the consequences of demand uncertainty (i.e., the cost of inventory excesses and shortages) with a retailer...
Holly Lutze, Özalp Özer
IJON
2006
109views more  IJON 2006»
13 years 7 months ago
Integrating the improved CBP model with kernel SOM
In this paper, we first design a more generalized network model, Improved CBP, based on the same structure as Circular BackPropagation (CBP) proposed by Ridella et al. The novelty ...
Qun Dai, Songcan Chen
CORR
2007
Springer
173views Education» more  CORR 2007»
13 years 7 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge
IR
2006
13 years 7 months ago
Hierarchical clustering of a Finnish newspaper article collection with graded relevance assessments
Search facilitated with agglomerative hierarchical clustering methods was studied in a collection of Finnish newspaper articles (N = 53,893). To allow quick experiments, clustering...
Tuomo Korenius, Jorma Laurikkala, Martti Juhola, K...