459 search results - page 42 / 92 » Computational Complexity of Probabilistic Disambiguation |
NIPS
2008
15 years 1 months ago
2008
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
INFOVIS
2003
IEEE
15 years 5 months ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
134
click to vote
ACIVS
2006
Springer
15 years 3 months ago
2006
Springer
Scene understanding is an important problem in intelligent robotics. Since visual information is uncertain due to several reasons, we need a novel method that has robustness to the...
DAC
1995
ACM
15 years 3 months ago
1995
ACM
- Power estimation in combinational modules is addressed from a probabilistic point of view. The zero-delay hypothesis is considered and under highly correlated input streams, the ...