Results 1  10
of
166,362
Vegas
"... Abstract: Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of idimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove “ 1 for some co ..."
Abstract
 Add to MetaCart
Abstract: Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of idimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd´1pKnqs is increasing for n large enough. In particular, the number of facets of the convex hull of n random pointsdistributeduniformlyandindependentlyinasmoothcompactconvexbodyisasymptotically increasing. Our proof relies on a random sampling argument. that if limnÑ8 Erfd´1pKnqs
Optimal Parallelization of Las Vegas Algorithms
 In Proceedings of the Annual Symposium on the Theoretical Aspects of Computer Science (STACS’94
, 1993
"... Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose running time is a random variable. In [1] a method was developed for minimizing the expected time required to obtain an answer from A using sequential strategies which si ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose running time is a random variable. In [1] a method was developed for minimizing the expected time required to obtain an answer from A using sequential strategies which
Ulrike Pogoda de la Vega
, 2016
"... Deinococcus radiodurans mutants indicate presence of a bypass UVrepair process ..."
Abstract
 Add to MetaCart
Deinococcus radiodurans mutants indicate presence of a bypass UVrepair process
The VEGA moderately parallel MIMD,
"... moderately parallel SIMD, architecture for high performance array signal processing ..."
Abstract
 Add to MetaCart
moderately parallel SIMD, architecture for high performance array signal processing
Prediction of Parallel Speedups for Las Vegas Algorithms
 PROCEEDINGS OF ICPP2013, 42ND INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, IEEE
, 2013
"... We propose a probabilistic model for the parallel execution of Las Vegas algorithms, i.e. randomized algorithms whose runtime might vary from one execution to another, even with the same input. This model aims at predicting the parallel performances (i.e. speedups) by analysis the runtime distributi ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We propose a probabilistic model for the parallel execution of Las Vegas algorithms, i.e. randomized algorithms whose runtime might vary from one execution to another, even with the same input. This model aims at predicting the parallel performances (i.e. speedups) by analysis the runtime
16 Incremental Motion Planning With Las Vegas Algorithms
"... Las Vegas algorithm is a powerful paradigm for a class of decision problems that has at least a theoretical exponential resolving time. Motion planning problems are one of those and are out to be solved only by high computational systems due to such a complexity (Schwartz & Sharir, 1983). As Las ..."
Abstract
 Add to MetaCart
Las Vegas algorithm is a powerful paradigm for a class of decision problems that has at least a theoretical exponential resolving time. Motion planning problems are one of those and are out to be solved only by high computational systems due to such a complexity (Schwartz & Sharir, 1983
Modular Las Vegas Algorithms for Polynomial Absolute Factorization
, 2010
"... Let f(X, Y) ∈ Z[X, Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely, of f modulo some prime integer p. The same idea of choosing a p satisfying some prescribed properties together with LLL is ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let f(X, Y) ∈ Z[X, Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely, of f modulo some prime integer p. The same idea of choosing a p satisfying some prescribed properties together with LLL
Jorge Vega
, 2005
"... Highvolume hemofiltration as salvage therapy in severe hyperdynamic septic shock ..."
Abstract
 Add to MetaCart
Highvolume hemofiltration as salvage therapy in severe hyperdynamic septic shock
Miguel Vega
"... In this paper, we consider the problem of parameter estimation on the super resolution and Bayesian methodology for pansharpening using contourlet transform. The used methodology is able to incorporate prior knowledge on the expected characteristics of the multispectral images, include information o ..."
Abstract
 Add to MetaCart
In this paper, we consider the problem of parameter estimation on the super resolution and Bayesian methodology for pansharpening using contourlet transform. The used methodology is able to incorporate prior knowledge on the expected characteristics of the multispectral images, include information on the unknown parameters in the form of hyperprior distributions and estimate the unknown parameters together with the high resolution multispectral image. The experimental results show that the proposed method not only enhances the spatial resolution of the pansharpened image, but also preserves the spectral information of the original multispectral image. Index Terms — pansharpening, superresolution, contourlets, multispectral image, remote sensing, parameter estimation
Results 1  10
of
166,362