1746 search results - page 28 / 350 » Recent Developments in Algorithmic Teaching |
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
A fundamental problem in signal processing is to estimate signal from noisy observations. When some prior information about the statistical models of the signal and noise is avail...
ICRA
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper provides a novel state vector and covariance sub-matrix recovery algorithm for a recently developed submap based exactly sparse Extended Information Filter (EIF) SLA...
ISAAC
1995
Springer
13 years 11 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
CSDA
2010
13 years 8 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...