Results 11  20
of
166,362
M. Vega
"... On the estimation of the maximum depth of investigation of transient electromagnetic soundings: the ..."
Abstract
 Add to MetaCart
On the estimation of the maximum depth of investigation of transient electromagnetic soundings: the
Optimal Speedup of Las Vegas Algorithms
 Information Processing Letters
, 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. We consider the problem of minimizing the expected time required to obtain an answer from A using strategies which simulate A as follow ..."
Abstract

Cited by 2 (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. We consider the problem of minimizing the expected time required to obtain an answer from A using strategies which simulate A
Chapter Number 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
Parallel Efficient Algorithms and Their Programming.
"... measures used to analyze algorithms are depth and work; arithmetic and communication costs are distinguished. The one corresponds to operations performed (macroinstructions nodes) while the other to access in the shared memory (data dependencies nodes). Arithmetic work and depth have been used for ..."
Abstract
 Add to MetaCart
for many years to analyze performances of parallel algorithms 8 In such a DFG, any output may be equivalently seen as a polynomial whose indeterminates are the inputs. The arithmetic degree is then the maximal degree of polynomials corresponding to the outputs. 28 CHAPTER 1. PARALLEL EFFICIENT
Quantum vs. classical communication and computation
 Proc. 30th Ann. ACM Symp. on Theory of Computing (STOC ’98
, 1998
"... We present a simple and general simulation technique that transforms any blackbox quantum algorithm (à la Grover’s database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism. This allows us to obtain new positive and ne ..."
Abstract

Cited by 158 (14 self)
 Add to MetaCart
We present a simple and general simulation technique that transforms any blackbox quantum algorithm (à la Grover’s database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the quantum parallelism. This allows us to obtain new positive
Laura Vega González Ion López
"... Aeronautics composite material inspection with a terahertz time ..."
German Vega LIG Grenoble University
"... Product Data Management (PDM) and Software Configuration Management (SCM) are the disciplines of building and controlling the evolution of a complex artifacts; either physical or software. Surprisingly, these two fields have evolved independently; their respective solutions to the same problems are ..."
Abstract
 Add to MetaCart
Product Data Management (PDM) and Software Configuration Management (SCM) are the disciplines of building and controlling the evolution of a complex artifacts; either physical or software. Surprisingly, these two fields have evolved independently; their respective solutions to the same problems are incompatible and their properties are different. PDM is good at modeling while SCM is good at building and supporting concurrent engineering. From a software engineering perspective, the challenge is to take the full potential of strong modeling capabilities, while preserving good concurrent engineering support. The paper shows that rich modeling, flexible evolution, and concurrent engineering supports have conflicting requirements and that a solution requires rethinking the concepts of evolution, versioning and modeling. We have developed a system, called CADSE (Computer Aided Domain Specific Environment), in which a product (software, physical or both) is modeled in a way similar to PDM and in which concurrent engineering and evolution is supported in the SCM way. To that end, the system is driven by models; evolution alone being defined through different models. The paper describes our system and discusses the early lessons of its first years of practical use.
Quick Approximation to Matrices and Applications
, 1998
"... We give algorithms to find the following simply described approximation to a given matrix. Given an m \Theta n matrix A with entries between say1 and 1, and an error parameter ffl between 0 and 1, we find a matrix D (implicitly) which is the sum of O(1=ffl 2 ) simple rank 1 matrices so that the ..."
Abstract

Cited by 144 (7 self)
 Add to MetaCart
Regularity Lemma of Szemerédi in Graph Theory and the constructive version of Alon, Duke, Leffman, Rödl and Yuster. The second one is from the papers of Arora, Karger and Karpinski, Fernandez de la Vega and most directly Goldwasser, Goldreich and Ron who develop approximation algorithms for a set of graph
ProjectTeam VEGAS Effective Geometric Algorithms for Visibility and Surfaces
"... c t i v it y e p o r t ..."
Results 11  20
of
166,362