Sciweavers

115 search results - page 3 / 23
» The Complexity of List Ranking of Trees
Sort
View
SPIRE
2010
Springer
13 years 7 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 2 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
IBPRIA
2007
Springer
14 years 13 days ago
Random Forest for Gene Expression Based Cancer Classification: Overlooked Issues
Random forest is a collection (ensemble) of decision trees. It is a popular ensemble technique in pattern recognition. In this article, we apply random forest for cancer classifica...
Oleg Okun, Helen Priisalu
BMCBI
2006
156views more  BMCBI 2006»
13 years 8 months ago
GOFFA: Gene Ontology For Functional Analysis - A FDA Gene Ontology Tool for Analysis of Genomic and Proteomic Data
Background: Gene Ontology (GO) characterizes and categorizes the functions of genes and their products according to biological processes, molecular functions and cellular componen...
Hongmei Sun, Hong Fang, Tao Chen, Roger Perkins, W...
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 8 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite