Sciweavers

2745 search results - page 301 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
AAAI
2012
13 years 7 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
AUTOMATICA
2005
137views more  AUTOMATICA 2005»
15 years 5 months ago
Multivariable frequency-response curve fitting with application to modal parameter estimation
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...
P. Verboven, P. Guillaume, B. Cauberghe
144
Voted
CGF
2004
117views more  CGF 2004»
15 years 4 months ago
Space-Time Hierarchical Radiosity with Clustering and Higher-Order Wavelets
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
Cyrille Damez, Nicolas Holzschuch, François...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 9 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
157
Voted
BMCBI
2006
142views more  BMCBI 2006»
15 years 5 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins