Sciweavers

1359 search results - page 55 / 272
» Probabilistic Points-to Analysis
Sort
View
NIPS
2007
13 years 10 months ago
Sparse Overcomplete Latent Variable Decomposition of Counts Data
An important problem in many fields is the analysis of counts data to extract meaningful latent components. Methods like Probabilistic Latent Semantic Analysis (PLSA) and Latent ...
Madhusudana V. S. Shashanka, Bhiksha Raj, Paris Sm...
P2P
2010
IEEE
202views Communications» more  P2P 2010»
13 years 7 months ago
Optimizing Near Duplicate Detection for P2P Networks
—In this paper, we propose a probabilistic algorithm for detecting near duplicate text, audio, and video resources efficiently and effectively in large-scale P2P systems. To thi...
Odysseas Papapetrou, Sukriti Ramesh, Stefan Siersd...
IPL
2006
103views more  IPL 2006»
13 years 8 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 3 months ago
On the semantics and evaluation of top-k queries in probabilistic databases
We formulate three intuitive semantic properties for topk queries in probabilistic databases, and propose GlobalTopk query semantics which satisfies all of them. We provide a dyn...
Xi Zhang, Jan Chomicki
AIPS
2009
13 years 9 months ago
Exploiting N-Gram Analysis to Predict Operator Sequences
N-gram analysis provides a means of probabilistically predicting the next item in a sequence. Due originally to Shannon, it has proven an effective technique for word prediction i...
Christian J. Muise, Sheila A. McIlraith, Jorge A. ...