Sciweavers

271 search results - page 21 / 55
» Comparison of two interactive search refinement techniques
Sort
View
136
Voted
SIGIR
2009
ACM
15 years 10 months ago
Evaluating web search using task completion time
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
Ya Xu, David Mease
121
Voted
COR
2010
150views more  COR 2010»
15 years 3 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
161
Voted
BMCBI
2004
162views more  BMCBI 2004»
15 years 3 months ago
Identifying spatially similar gene expression patterns in early stage fruit fly embryo images: binary feature versus invariant m
Background: Modern developmental biology relies heavily on the analysis of embryonic gene expression patterns. Investigators manually inspect hundreds or thousands of expression p...
Rajalakshmi Gurunathan, Bernard Van Emden, Sethura...
167
Voted
CVPR
2007
IEEE
15 years 7 months ago
Diverse Active Ranking for Multimedia Search
Interactively learning from a small sample of unlabeled examples is an enormously challenging task, one that often arises in vision applications. Relevance feedback and more recen...
ShyamSundar Rajaram, Charlie K. Dagli, Nemanja Pet...
137
Voted
IASTEDSE
2004
15 years 4 months ago
A deterministic density algorithm for pairwise interaction coverage
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test suites for pairwise coverage are evaluated according ...
Charles J. Colbourn, Myra B. Cohen, Renée T...