Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
45
The Effects of Time on Query Flow Graph-based Models for Query Suggestion
"... A recent query-log mining approach for query recommendation is based on Query Flow Graphs, a markov-chain representation of the query reformulation process followed by users of Web Search Engines trying to satisfy their information needs. In this paper we aim at extending this model by providing met ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
A recent query-log mining approach for query recommendation is based on Query Flow Graphs, a markov-chain representation of the query reformulation process followed by users of Web Search Engines trying to satisfy their information needs. In this paper we aim at extending this model by providing
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Query Suggestion and Data Fusion in Contextual Disambiguation
"... Queries issued to a search engine are often under-specified or am-biguous. The user’s search context or background may provide information that disambiguates their information need in order to automatically predict and issue a more effective query. The disam-biguation can take place at different sta ..."
Abstract
- Add to MetaCart
quality and user context. We show that our context-sensitive result fusion approach (Corfu) improves retrieval quality for ambiguous queries by up to 2.92%. Our ap-proaches can efficiently scale to massive search logs, enabling a data-driven strategy that benefits from observing how users issue
Spelling Correction Based on User Search Contextual Analysis and Domain Knowledge
"... We propose a spelling correction algorithm that combines trusted domain knowledge and query log information for query spelling correction. This algorithm uses query reformulations in the query log and bigram language models built from queries for efficiently and effectively generating correction sug ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We propose a spelling correction algorithm that combines trusted domain knowledge and query log information for query spelling correction. This algorithm uses query reformulations in the query log and bigram language models built from queries for efficiently and effectively generating correction
A day in the life of web searching: an exploratory study
- Information Processing and Management
, 2004
"... * To whom all correspondence should be addressed. 1 Understanding Web searching behavior is important in developing more successful and cost-efficient Web search engines. We provide results from a comparative time-based Web study of US-based Excite and Norwegian-based Fast Web search logs, exploring ..."
Abstract
-
Cited by 33 (4 self)
- Add to MetaCart
* To whom all correspondence should be addressed. 1 Understanding Web searching behavior is important in developing more successful and cost-efficient Web search engines. We provide results from a comparative time-based Web study of US-based Excite and Norwegian-based Fast Web search logs
Similarity measures for short segments of text
- In Proc. of ECIR-07
, 2007
"... Abstract. Measuring the similarity between documents and queries has been extensively studied in information retrieval. However, there are a growing number of tasks that require computing the similarity between two very short segments of text. These tasks include query reformulation, sponsored searc ..."
Abstract
-
Cited by 68 (3 self)
- Add to MetaCart
of similarity measures, including purely lexical measures, stemming, and language modeling-based measures. We formally evaluate and analyze the methods on a query-query similarity task using 363,822 queries from a web search log. Our analysis provides insights into the strengths and weaknesses of each method
DOI 10.1007/s00778-012-0302-x SPECIAL ISSUE PAPER Automating the database schema evolution process
"... Abstract Supporting database schema evolution repre-sents a long-standing challenge of practical and theoretical importance for modern information systems. In this paper, we describe techniques and systems for automating the critical tasks of migrating the database and rewriting the legacy applicati ..."
Abstract
- Add to MetaCart
, by solving the difficult prob-lem of automating the migration of databases and the rewrit-ing of queries and updates. In this paper, we present the PRISM/PRISM++ system and the novel technology that made it possible. In particular, we focus on the difficult and previously unsolved problem of supporting
Submitted for consideration to GPCE 2015 Native-2-Native Automated Cross-Platform Code Synthesis from Web-Based Programming Resources
"... For maximal market penetration, popular mobile applications are typically supported on all major platforms, including Android and iOS. Despite the vast differences in the look-and-feel of major mo-bile platforms, applications running on these platforms in essence provide the same core functionality. ..."
Abstract
- Add to MetaCart
modifies a mobile application’s Android version to make use of some native resource, with a plugin capturing code changes. Based on the changes, the system then parameter-izes a web search query over popular programming resources (e.g., Google Code, StackOverflow, etc.), to discover equivalent iOS code
doi:10.1093/comjnl/bxp026 A Digest and Pattern Matching-Based Intrusion Detection Engine
, 2008
"... Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real-wor ..."
Abstract
- Add to MetaCart
Intrusion detection/prevention systems (IDSs/IPSs) heavily rely on signature databases and pattern matching (PM) techniques to identify network attacks. The engines of such systems often employ traditional PM algorithms to search for telltale patterns in network flows. The observations that real
Measuring Index Quality using Random Walks on the Web
- In Proceedings of the Eighth International World Wide Web Conference
, 1999
"... Recent research has studied how to measure the size of a search engine, in terms of the number of pages indexed. In this paper, we consider a different measure for search engines, namely the quality of the pages in a search engine index. We provide a simple, effective algorithm for approximating t ..."
Abstract
- Add to MetaCart
Recent research has studied how to measure the size of a search engine, in terms of the number of pages indexed. In this paper, we consider a different measure for search engines, namely the quality of the pages in a search engine index. We provide a simple, effective algorithm for approximating
Results 1 - 10
of
45
