Sciweavers

291 search results - page 52 / 59
» General Convergence Results for Linear Discriminant Updates
Sort
View
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 28 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
EDBT
2009
ACM
145views Database» more  EDBT 2009»
14 years 14 days ago
An efficient online auditing approach to limit private data disclosure
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
Haibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaid...
MP
2002
176views more  MP 2002»
13 years 8 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
13 years 9 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
BMCBI
2005
122views more  BMCBI 2005»
13 years 8 months ago
GenClust: A genetic algorithm for clustering gene expression data
Background: Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designe...
Vito Di Gesù, Raffaele Giancarlo, Giosu&egr...