Sciweavers

333 search results - page 12 / 67
» Speeding up moving-target search
Sort
View
CEC
2010
IEEE
14 years 10 months ago
Parallel hybrid evolutionary algorithms on GPU
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
64
Voted
CVPR
2007
IEEE
16 years 3 days ago
A contextual dissimilarity measure for accurate and efficient image search
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
Herve Jegou, Hedi Harzallah, Cordelia Schmid
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
FOCS
2003
IEEE
15 years 3 months ago
Quantum Search of Spatial Regions
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
Scott Aaronson, Andris Ambainis
81
Voted
SBBD
2004
82views Database» more  SBBD 2004»
14 years 11 months ago
Optimizing Ranking Calculation in Web Search Engines: a Case Study
Web search engines compete to offer the fastest responses with highest relevance. However, as Web collections grow, it becomes more difficult to achieve this purpose. As most user...
Miguel Costa, Mário J. Silva