Sciweavers

1561 search results - page 181 / 313
» Probability Theory on IF Events
Sort
View
ICPR
2002
IEEE
15 years 11 months ago
Robust Appearance-Based Object Recognition Using a Fully Connected Markov Random Field
This paper presents a new kernel method for appearance-based object recognition, highly robust to noise and occlusion. It consists of a fully connected Markov Random Field that in...
Barbara Caputo, Sahla Bouattour, Heinrich Niemann
ICML
2009
IEEE
15 years 11 months ago
Archipelago: nonparametric Bayesian semi-supervised learning
Semi-supervised learning (SSL), is classification where additional unlabeled data can be used to improve accuracy. Generative approaches are appealing in this situation, as a mode...
Ryan Prescott Adams, Zoubin Ghahramani
WWW
2009
ACM
15 years 11 months ago
A densitometric analysis of web template content
What makes template content in the Web so special that we need to remove it? In this paper I present a large-scale aggregate analysis of textual Web content, corroborating statist...
Christian Kohlschütter
IEEECGIV
2009
IEEE
15 years 5 months ago
Two Dimensional Compressive Classifier for Sparse Images
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
Armin Eftekhari, Hamid Abrishami Moghaddam, Massou...
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
15 years 5 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...