Sciweavers

1283 search results - page 70 / 257
» Probabilistic structured query methods
Sort
View
ICASSP
2010
IEEE
13 years 9 months ago
Prior-based vanishing point estimation through global perspective structure matching
In this paper, we describe a prior-based vanishing point estimation method through global perspective structure matching (GPSM). In contrast to the traditional approaches which re...
Qi Wu, Wende Zhang, Tsuhan Chen, B. V. K. Vijaya K...
WWW
2006
ACM
14 years 9 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
CVPR
2010
IEEE
14 years 2 months ago
Image Retrieval via Probabilistic Hypergraph Ranking
In this paper, we propose a new transductive learning framework for image retrieval, in which images are taken as vertices in a weighted hypergraph and the task of image search is...
Yuchi Huang, Qingshan Liu, Shaoting Zhang, Metaxas...
TOC
2010
155views Management» more  TOC 2010»
13 years 3 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis
SIGIR
2010
ACM
13 years 9 months ago
Generalized syntactic and semantic models of query reformulation
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...