Sciweavers

333 search results - page 42 / 67
» Speeding up moving-target search
Sort
View
93
Voted
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
15 years 10 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
EDBT
2008
ACM
166views Database» more  EDBT 2008»
15 years 10 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
CRV
2008
IEEE
165views Robotics» more  CRV 2008»
15 years 4 months ago
Hierarchical Stereo with Thin Structures and Transparency
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
Mikhail Sizintsev
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
15 years 4 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
15 years 4 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan