Sciweavers

5746 search results - page 179 / 1150
» Visualizing Query Structure
Sort
View
ECIR
2009
Springer
16 years 3 months ago
A Probabilistic Retrieval Model for Semistructured Data
Abstract. Retrieving semistructured (XML) data typically requires either a structured query such as XPath, or a keyword query that does not take structure into account. In this pap...
Jinyoung Kim, Xiaobing Xue, W. Bruce Croft
DATESO
2009
101views Database» more  DATESO 2009»
15 years 4 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
ICCV
2007
IEEE
16 years 20 days ago
Total Recall: Automatic Query Expansion with a Generative Feature Model for Object Retrieval
Given a query image of an object, our objective is to retrieve all instances of that object in a large (1M+) image database. We adopt the bag-of-visual-words architecture which ha...
Ondrej Chum, James Philbin, Josef Sivic, Michael I...
CIDR
2003
106views Algorithms» more  CIDR 2003»
15 years 7 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
BMCBI
2008
137views more  BMCBI 2008»
15 years 6 months ago
VennMaster: Area-proportional Euler diagrams for functional GO analysis of microarrays
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...
Hans A. Kestler, André Müller, Johann ...