4843 search results - page 374 / 969 » The Shortcut Problem - Complexity and Approximation |
114
click to vote
NIPS
2003
15 years 5 months ago
2003
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...
121
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
139
click to vote
CSDA
2006
15 years 4 months ago
2006
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
142
click to vote
TCS
2008
15 years 4 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
113
click to vote
MOC
2000
15 years 4 months ago
2000
Abstract. This paper is concerned with the mixed formulation of the Boussinesq equations in two-dimensional domains and its numerical approximation. The paper deals first with exis...