Sciweavers

1168 search results - page 189 / 234
» Optimization strategies for complex queries
Sort
View
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 9 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 1 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
SPAA
2009
ACM
14 years 10 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
ICFP
2008
ACM
14 years 9 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
GECCO
2003
Springer
165views Optimization» more  GECCO 2003»
14 years 2 months ago
An Evolutionary Approach for Molecular Docking
We have developed an evolutionary approach for the flexible docking that is now an important component of a rational drug design. This automatic docking tool, referred to as the G...
Jinn-Moon Yang