3972 search results - page 615 / 795 » Cosparse analysis modeling - uniqueness and algorithms |
205
click to vote
SIGIR
2010
ACM
15 years 11 months ago
2010
ACM
We build a probabilistic model to identify implicit local intent queries, and leverage user’s physical location to improve Web search results for these queries. Evaluation on co...
172
Voted
BPM
2008
Springer
15 years 9 months ago
2008
Springer
We present a finite representation of all services M where the composition with a given service N is deadlock-free, and a given set of activities of N can be covered (i.e. is not d...
138
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
162
Voted
ICMLA
2007
15 years 8 months ago
2007
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
178
click to vote
NIPS
2001
15 years 8 months ago
2001
The adaptive TAP Gibbs free energy for a general densely connected probabilistic model with quadratic interactions and arbritary single site constraints is derived. We show how a ...