1300 search results - page 87 / 260 » Probabilistic logic with independence |
PKDD
2005
Springer
14 years 2 months ago
2005
Springer
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 ...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
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...
ICIAR
2004
Springer
14 years 2 months ago
2004
Springer
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
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...
PE
2000
Springer
13 years 8 months ago
2000
Springer
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...