Sciweavers

503 search results - page 93 / 101
» Probabilistic Weighted Automata
Sort
View
CIKM
2010
Springer
13 years 7 months ago
What can quantum theory bring to information retrieval
The probabilistic formalism of quantum physics is said to provide a sound basis for building a principled information retrieval framework. Such a framework can be based on the not...
Benjamin Piwowarski, Ingo Frommholz, Mounia Lalmas...
PVLDB
2010
151views more  PVLDB 2010»
13 years 7 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
NAACL
2010
13 years 6 months ago
Minimally-Supervised Extraction of Entities from Text Advertisements
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
Sameer Singh, Dustin Hillard, Chris Leggetter
EUSFLAT
2009
175views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
The Minimization of the Risk of Falling in Portfolios under Uncertainty
Abstract-- A portfolio model to minimize the risk of falling under uncertainty is discussed. The risk of falling is represented by the value-at-risk of rate of return. Introducing ...
Yuji Yoshida
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 11 days ago
Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge
ā€” This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on realworld link predictio...
Arvind Narayanan, Elaine Shi, Benjamin I. P. Rubin...