Results 281 to 290 of about 12,143,613 (336)
Some of the next articles are maybe not open access.
K-search: Searching for clusters
2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012This paper introduces the K-search algorithm, a method for locating an unknown number of well-separated multidimensional clusters from sampled data in the presence of outliers. K-search finds tightly packed point clouds, a characteristic of Gaussian data close to a mean value, to identify potential Gaussian means.
Rhonda D. Phillips, Bijaya Zenchenko
openaire +1 more source
Search-o1: Agentic Search-Enhanced Large Reasoning Models
Conference on Empirical Methods in Natural Language ProcessingLarge reasoning models (LRMs) like OpenAI-o1 have demonstrated impressive long stepwise reasoning capabilities through large-scale reinforcement learning.
Xiaoxi Li +7 more
semanticscholar +1 more source
Associating Searching on Search Engines to Subsequent Searching on Sites
International Journal of Information Systems in the Service Sector, 2016In this research study, the authors investigate the association between external searching, which is searching on a web search engine, and internal searching, which is searching on a website. They classify 295,571 external – internal searches where each search is composed of a search engine query that is submitted to a web search engine and then one or
Adan Ortiz-Cordova, Bernard J. Jansen
openaire +1 more source
SSRN Electronic Journal, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Albrecht +2 more
openaire +2 more sources
Graph Searching and Search Time
2006Graph searching is the game of capturing a fugitive by a team of searchers in a network. There are equivalent characterizations in terms of path-width, interval thickness, and vertex separation. So far the interest has mainly focused on the search number of a graph, which is the minimal the number of searchers to win the game, and accordingly on the ...
Franz-Josef Brandenburg +1 more
openaire +1 more source
Cuckoo Search via Lévy flights
World Congress on Nature and Biologically Inspired Computing, 2009In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Lévy ...
Xin-She Yang, S. Deb
semanticscholar +1 more source
R1-Searcher: Incentivizing the Search Capability in LLMs via Reinforcement Learning
arXiv.orgExisting Large Reasoning Models (LRMs) have shown the potential of reinforcement learning (RL) to enhance the complex reasoning capabilities of Large Language Models~(LLMs).
Huatong Song +7 more
semanticscholar +1 more source
Searching for Relevance in the Relevance of Search
2005Discussion of relevance has permeated the information science literature for the past 50+ years, and yet we are no closer to resolution of the matter. In this research we developed a set of measures to operationalize the dimensions underpinning Saracevic's manifestations of relevance. We used an existing data set collected from 48 participants who used
Elaine G. Toms +3 more
openaire +1 more source
Algorithms of oppression: how search engines reinforce racism
Information, Communication & Society, 2019What can possibly be more mundane than a Google search? We use the search engine countless times day in day out, allowing it to classify, retrieve, rank and order the information we request.
Kinga Polynczuk-Alenius
semanticscholar +1 more source
IEEE Transactions on Knowledge and Data Engineering, 2002
A large fraction of the useful web comprises of specification documents that largely consist of hattribute name, numeric valuei pairs embedded in text. Examples include product information, classified advertisements, resumes, etc. The approach taken in the past to search these documents by first establishing correspondences between values and their ...
Rakesh Agrawal 0001 +1 more
openaire +1 more source
A large fraction of the useful web comprises of specification documents that largely consist of hattribute name, numeric valuei pairs embedded in text. Examples include product information, classified advertisements, resumes, etc. The approach taken in the past to search these documents by first establishing correspondences between values and their ...
Rakesh Agrawal 0001 +1 more
openaire +1 more source