For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
We study the joint feature selection problem when learning multiple related classification or regression tasks. By imposing an automatic relevance determination prior on the hypo...
Tao Xiong, Jinbo Bi, R. Bharat Rao, Vladimir Cherk...
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...