Sciweavers

466 search results - page 44 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
SIGMOD
2011
ACM
203views Database» more  SIGMOD 2011»
14 years 8 months ago
Effective data co-reduction for multimedia similarity search
Multimedia similarity search has been playing a critical role in many novel applications. Typically, multimedia objects are described by high-dimensional feature vectors (or point...
Zi Huang, Heng Tao Shen, Jiajun Liu, Xiaofang Zhou
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
16 years 5 days ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
CPAIOR
2008
Springer
15 years 7 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 6 months ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng
SOFSEM
2000
Springer
15 years 9 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt