Sciweavers

509 search results - page 52 / 102
» Efficient indexing for large scale visual search
Sort
View
CLOUDCOM
2010
Springer
13 years 5 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin
ECOOP
2009
Springer
14 years 8 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan
NAR
2011
189views Computer Vision» more  NAR 2011»
12 years 10 months ago
EDULISS: a small-molecule database with data-mining and pharmacophore searching capabilities
We present the relational database EDULISS (EDinburgh University Ligand Selection System), which stores structural, physicochemical and pharmacophoric properties of small molecule...
Kun-Yi Hsin, Hugh P. Morgan, Steven R. Shave, Andr...
IJRR
2010
115views more  IJRR 2010»
13 years 4 months ago
Improving the Efficiency of Clearing with Multi-agent Teams
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
Geoffrey Hollinger, Sanjiv Singh, Athanasios Kehag...
DAGSTUHL
2006
13 years 9 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl