Sciweavers

1283 search results - page 80 / 257
» Probabilistic structured query methods
Sort
View
DEBU
2010
104views more  DEBU 2010»
13 years 9 months ago
Query Results Ready, Now What?
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
Ziyang Liu, Yi Chen
IJPRAI
2002
142views more  IJPRAI 2002»
13 years 8 months ago
Improving Encarta Search Engine Performance by Mining User Logs
We propose a data-mining approach that produces generalized query patterns (with generalized keywords) from the raw user logs of the Microsoft Encarta search engine (http://encart...
Charles X. Ling, Jianfeng Gao, Huajie Zhang, Weini...
CVPR
2004
IEEE
14 years 11 months ago
Probabilistic Expression Analysis on Manifolds
In this paper, we propose a probabilistic videobased facial expression recognition method on manifolds. The concept of the manifold of facial expression is based on the observatio...
Ya Chang, Changbo Hu, Matthew Turk
ENTCS
2007
85views more  ENTCS 2007»
13 years 8 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 25 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve