Results 221 to 230 of about 658,036 (261)
Some of the next articles are maybe not open access.
Search Unemployment with On-the-job Search
The Review of Economic Studies, 1994A substantial fraction of workers who quit their jobs and a smaller but still substantial fraction of workers hired into jobs do not experience interim periods of unemployment (more generally, non-employment). How big the respective fractions are is difficult to say, because of the absence of good data.
Pissarides, Christopher A. +1 more
openaire +3 more sources
2010
We present findings from an analysis of a database released by an online search provider in 2006. We show that there exists a significantly large number of queries which are shared by users when searching on the Web today. We then propose a network which uses shared queries to preserve the privacy of its participants.
Wesley Brandi, Martin S. Olivier
openaire +1 more source
We present findings from an analysis of a database released by an online search provider in 2006. We show that there exists a significantly large number of queries which are shared by users when searching on the Web today. We then propose a network which uses shared queries to preserve the privacy of its participants.
Wesley Brandi, Martin S. Olivier
openaire +1 more source
Searching for a Global Search Algorithm
Automated Software Engineering, 1997We report on a case study to assess the use of an advanced knowledge-based software design technique to programmers who have not participated in the technique's development. We use the KIDS approach to algorithm design to construct two global search algorithms that route baggage through a transportation net.
Sabine Dick, Thomas Santen
openaire +1 more source
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
SSRN Electronic Journal, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Albrecht +2 more
openaire +2 more sources
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
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
Communications of the ACM
Does AI improve, or misdirect, search engines and their results?
openaire +1 more source
Does AI improve, or misdirect, search engines and their results?
openaire +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
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