Sciweavers

1160 search results - page 70 / 232
» A Colour Object Search Algorithm
Sort
View
115
Voted
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
15 years 9 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
106
Voted
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
15 years 4 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
118
Voted
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
15 years 9 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
125
Voted
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 7 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
220
Voted
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
16 years 4 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis