Sciweavers

231 search results - page 13 / 47
» Sensitivity of trust-region algorithms to their parameters
Sort
View
IPPS
2002
IEEE
14 years 10 days ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin
COLING
2010
13 years 2 months ago
Conundrums in Unsupervised Keyphrase Extraction: Making Sense of the State-of-the-Art
State-of-the-art approaches for unsupervised keyphrase extraction are typically evaluated on a single dataset with a single parameter setting. Consequently, it is unclear how effe...
Kazi Saidul Hasan, Vincent Ng
ADC
2010
Springer
204views Database» more  ADC 2010»
13 years 2 months ago
Systematic clustering method for l-diversity model
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
Md. Enamul Kabir, Hua Wang, Elisa Bertino, Yunxian...
CIMAGING
2009
130views Hardware» more  CIMAGING 2009»
13 years 5 months ago
Quantitative phase and amplitude imaging using Differential-Interference Contrast (DIC) microscopy
We present an extension of the development of an alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitude and phase...
Chrysanthe Preza, Joseph A. O'Sullivan
ISSAC
2007
Springer
199views Mathematics» more  ISSAC 2007»
14 years 1 months ago
A sparse modular GCD algorithm for polynomials over algebraic function fields
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan