Sciweavers

3055 search results - page 331 / 611
» Randomized Search Trees
Sort
View
SIGIR
2008
ACM
15 years 3 months ago
A unified and discriminative model for query refinement
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
Jiafeng Guo, Gu Xu, Hang Li, Xueqi Cheng
163
Voted
RECOMB
2006
Springer
16 years 3 months ago
Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer
Prokaryotic organisms share genetic material across species boundaries by means of a process known as horizontal gene transfer (HGT). Detecting this process bears great significanc...
Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nak...
132
Voted
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 7 months ago
Oracle8i Index-Organized Table and Its Application to New Domains
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
Jagannathan Srinivasan, Souripriya Das, Chuck Frei...
ESEM
2007
ACM
15 years 7 months ago
The Effects of Over and Under Sampling on Fault-prone Module Detection
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...
Yasutaka Kamei, Akito Monden, Shinsuke Matsumoto, ...
123
Voted
CIE
2006
Springer
15 years 7 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante