Sciweavers

724 search results - page 37 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
CORR
1999
Springer
116views Education» more  CORR 1999»
14 years 11 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
BMCBI
2005
67views more  BMCBI 2005»
14 years 11 months ago
Selecting additional tag SNPs for tolerating missing data in genotyping
Background: Recent studies have shown that the patterns of linkage disequilibrium observed in human populations have a block-like structure, and a small subset of SNPs (called tag...
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 1 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
GECCO
2010
Springer
206views Optimization» more  GECCO 2010»
15 years 3 months ago
Development of efficient particle swarm optimizers by using concepts from evolutionary algorithms
Particle swarm optimization (PSO) has been in practice for more than 10 years now and has gained wide popularity in various optimization tasks. In the context to single objective ...
Kalyanmoy Deb, Nikhil Padhye
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 26 days ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue