Sciweavers

1554 search results - page 285 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 4 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
CVPR
2010
IEEE
15 years 7 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
Shubao Liu, David Cooper
BMCBI
2010
178views more  BMCBI 2010»
15 years 4 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
JMLR
2011
157views more  JMLR 2011»
14 years 11 months ago
Variable Sparsity Kernel Learning
This paper1 presents novel algorithms and applications for a particular class of mixed-norm regularization based Multiple Kernel Learning (MKL) formulations. The formulations assu...
Jonathan Aflalo, Aharon Ben-Tal, Chiranjib Bhattac...
SIAMCOMP
2011
14 years 11 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio