|
March 28, 2011
Steinberger described the media monitoring software developed by JRC which gathers and analyses between 80,000 and 100,000 news articles per day in up to fifty languages. The software clusters ...
|
|
March 28, 2011
Latent force models encode the interaction between multiple related dynamical systems in the form of a kernel or covariance function. Each variable to be modeled is represented as the output of a ...
|
|
March 28, 2011
Identifying the features of objects becomes a challenge when those features can change in their appearance. We introduce the Transformed Indian Buffet Process (tIBP), and use it to define a ...
|
|
March 28, 2011
We study the problem of segmenting specific white matter structures of interest from Diffusion Tensor (DT-MR) images of the human brain. This is an important requirement in many Neuroimaging ...
|
|
March 28, 2011
We consider online learning in finite stochastic Markovian environments where in each time step a new reward function is chosen by an oblivious adversary. The goal of the learning agent is to ...
|
|
March 28, 2011
Grefenstette introduced Exalead as a global software provider in the enterprise and Web search markets, which tries to integrate research functions in one piece of software, combining Internet, ...
|
|
March 28, 2011
We present a novel probabilistic model for distributions over sets of structures — for example, sets of sequences, trees, or graphs. The critical characteristic of our model is a ...
|
|
March 28, 2011
Bayesian methods of matrix factorization (MF) have been actively explored recently as promising alternatives to classical singular value decomposition. In this paper, we show that, despite the ...
|
|
March 28, 2011
Bayesian approaches to utility elicitation typically adopt (myopic) expected value of information (EVOI) as a natural criterion for selecting queries. However, EVOI-optimization is usually ...
|
|
March 28, 2011
We study worst-case bounds on the quality of any fixed point assignment of the max-product algorithm for Markov Random Fields (MRF). We start proving a bound independent of the MRF structure and ...
|
|
March 28, 2011
Modern Paris was indelibly shaped by the rebuilding project ordered by Napoleon III and carried out by Baron Haussmann in the 1850s and '60s. The large-scale demolition of whole ...
|
|
March 28, 2011
|
|
March 26, 2011
Undirected graphical models encode in a graph G the dependency structure of a random vector Y. In many applications, it is of interest to model Y given another random vector X as input. We refer ...
|
|
March 26, 2011
Since the discovery of sophisticated fully polynomial randomized algorithms for a range of #P problems (Karzanov et al., 1991; Jerrum et al., 2001; Wilson, 2004), theoretical work on approximate ...
|
|
March 26, 2011
Despite the ubiquity of clustering as a tool in unsupervised learning, there is not yet a consensus on a formal theory, and the vast majority of work in this direction has focused on unsupervised ...
|
|
March 26, 2011
We propose a new supervised learning framework for visual object counting tasks, such as estimating the number of cells in a microscopic image or the number of humans in surveillance video ...
|
|
March 26, 2011
Computing two-way and multi-way set similarities is a fundamental problem. This study focuses on estimating 3-way resemblance (Jaccard similarity) using b-bit minwise hashing. While traditional ...
|
|
March 26, 2011
In this paper we consider the fundamental problem of semi-supervised kernel function learning. We propose a general regularized framework for learning a kernel matrix, and then demonstrate an ...
|
|
March 26, 2011
We consider the problem of reinforcement learning in high-dimensional spaces when the number of features is bigger than the number of samples. In particular, we study the least-squares temporal ...
|
|
March 26, 2011
The commute distance between two vertices in a graph is the expected time it takes a random walk to travel from the first to the second vertex and back. We study the behavior of the commute ...
|
|
|
|
|
|
Featured Content
Featuring websites that enhance the internet user’s experience.
|