Sciweavers

211 search results - page 18 / 43
» BoostMap: A Method for Efficient Approximate Similarity Rank...
Sort
View
WABI
2009
Springer
102views Bioinformatics» more  WABI 2009»
14 years 2 months ago
A Tree Based Method for the Rapid Screening of Chemical Fingerprints
Background: The fingerprint of a molecule is a bitstring based on its structure, constructed such that structurally similar molecules will have similar fingerprints. Molecular fin...
Thomas G. Kristensen, Jesper Nielsen, Christian N....
EOR
2002
125views more  EOR 2002»
13 years 7 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
ICML
2009
IEEE
14 years 8 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
14 years 7 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
WWW
2004
ACM
14 years 8 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey