Sciweavers

236 search results - page 17 / 48
» Learning How to Propagate Using Random Probing
Sort
View
JSAT
2008
85views more  JSAT 2008»
13 years 7 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
SIGIR
2009
ACM
14 years 2 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
WSDM
2010
ACM
254views Data Mining» more  WSDM 2010»
14 years 5 months ago
Learning Influence Probabilities In Social Networks
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
Amit Goyal 0002, Francesco Bonchi, Laks V. S. Laks...
COLT
2004
Springer
14 years 1 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
ICML
2010
IEEE
13 years 8 months ago
Supervised Aggregation of Classifiers using Artificial Prediction Markets
Prediction markets are used in real life to predict outcomes of interest such as presidential elections. In this work we introduce a mathematical theory for Artificial Prediction ...
Nathan Lay, Adrian Barbu