Sciweavers

1940 search results - page 119 / 388
» Optimizing search engines using clickthrough data
Sort
View
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 10 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
CVPR
2008
IEEE
15 years 5 days ago
Filtering Internet image search results towards keyword based category recognition
In this work we aim to capitalize on the availability of Internet image search engines to automatically create image training sets from user provided queries. This problem is part...
Kamil Wnuk, Stefano Soatto
CEC
2007
IEEE
14 years 4 months ago
Comparing bio-inspired algorithms in constrained optimization problems
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
Efrén Mezura-Montes, Blanca Cecilia Lopez-R...
ECCV
2010
Springer
14 years 3 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
SIGIR
2005
ACM
14 years 3 months ago
Optimization strategies for complex queries
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
Trevor Strohman, Howard R. Turtle, W. Bruce Croft