Sciweavers

1283 search results - page 87 / 257
» Probabilistic structured query methods
Sort
View
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
14 years 19 days ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
TREC
2008
13 years 10 months ago
Document and Query Expansion Models for Blog Distillation
This paper presents the CMU submission to the 2008 TREC blog distillation track. Similar to last year's experiments, we evaluate different retrieval models and apply a query ...
Jaime Arguello, Jonathan L. Elsas, Changkuk Yoo, J...
CVPR
2004
IEEE
14 years 11 months ago
A Graphical Model Framework for Coupling MRFs and Deformable Models
This paper proposes a new framework for image segmentation based on the integration of MRFs and deformable models using graphical models. We first construct a graphical model to r...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas
ADC
2005
Springer
97views Database» more  ADC 2005»
14 years 2 months ago
Querying and Maintaining Ordered XML Data using Relational Databases
Although data stored in XML is of increasing importance, most existing data repositories are still managed by relational database systems. In light of this, recent XML database re...
William M. Shui, Franky Lam, Damien K. Fisher, Ray...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 3 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich