Sciweavers

1244 search results - page 72 / 249
» Searching in Higher Dimension
Sort
View
WWW
2005
ACM
14 years 10 months ago
A framework for determining necessary query set sizes to evaluate web search effectiveness
We describe a framework of bootstrapped hypothesis testing for estimating the confidence in one web search engine outperforming another over any randomly sampled query set of a gi...
Eric C. Jensen, Steven M. Beitzel, Ophir Frieder, ...
CHI
2008
ACM
14 years 10 months ago
Query suggestions for mobile search: understanding usage patterns
Entering search terms on mobile phones is a time consuming and cumbersome task. In this paper, we explore the usage patterns of query entry interfaces that display suggestions. Ou...
Maryam Kamvar, Shumeet Baluja
CIKM
2009
Springer
14 years 4 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICDCSW
2006
IEEE
14 years 4 months ago
Improve Searching by Reinforcement Learning in Unstructured P2Ps
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Xiuqi Li, Jie Wu
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 3 months ago
Enhancing differential evolution performance with local search for high dimensional function optimization
In this paper, we proposed Fittest Individual Refinement (FIR), a crossover based local search method for Differential Evolution (DE). The FIR scheme accelerates DE by enhancing...
Nasimul Noman, Hitoshi Iba