Sciweavers

3969 search results - page 706 / 794
» Query Processing Using Ontologies
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 10 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
ICADL
2005
Springer
137views Education» more  ICADL 2005»
15 years 9 months ago
A Collaborative Filtering Based Re-ranking Strategy for Search in Digital Libraries
Users of a digital book library system typically interact with the system to search for books by querying on the metadata describing the books or to search for information in the p...
U. Rohini, Vamshi Ambati
HICSS
2003
IEEE
176views Biometrics» more  HICSS 2003»
15 years 9 months ago
Ad-Hoc Association-Rule Mining within the Data Warehouse
Many organizations often underutilize their already constructed data warehouses. In this paper, we suggest a novel way of acquiring more information from corporate data warehouses...
Svetlozar Nestorov, Nenad Jukic
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 9 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SIGIR
2010
ACM
15 years 8 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...