Results 1  10
of
2,705,958
A Simple Proof of the Restricted Isometry Property for Random Matrices
 CONSTR APPROX
, 2008
"... We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided algorithmical ..."
Abstract

Cited by 631 (64 self)
 Add to MetaCart
We give a simple technique for verifying the Restricted Isometry Property (as introduced by Candès and Tao) for random matrices that underlies Compressed Sensing. Our approach has two main ingredients: (i) concentration inequalities for random inner products that have recently provided
Representation Theory of Artin Algebras
 Studies in Advanced Mathematics
, 1994
"... The representation theory of artin algebras, as we understand it today, is a relatively new area of mathematics, as most of the main developments have occurred ..."
Abstract

Cited by 644 (10 self)
 Add to MetaCart
The representation theory of artin algebras, as we understand it today, is a relatively new area of mathematics, as most of the main developments have occurred
A theory of communicating sequential processes
, 1984
"... A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account. ..."
Abstract

Cited by 4176 (17 self)
 Add to MetaCart
A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3254 (70 self)
 Add to MetaCart
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type
A review of image denoising algorithms, with a new one
 SIMUL
, 2005
"... The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication of the recently proposed methods, most algorithms have not yet attained a desirable level of applicability. All show an outstanding perf ..."
Abstract

Cited by 509 (6 self)
 Add to MetaCart
performance when the image model corresponds to the algorithm assumptions but fail in general and create artifacts or remove image fine structures. The main focus of this paper is, first, to define a general mathematical and experimental methodology to compare and classify classical image denoising algorithms
An axiomatic basis for computer programming
 COMMUNICATIONS OF THE ACM
, 1969
"... In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference w ..."
Abstract

Cited by 1753 (4 self)
 Add to MetaCart
In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference
Voronoi diagrams  a survey of a fundamental geometric data structure
 ACM COMPUTING SURVEYS
, 1991
"... This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. ..."
Abstract

Cited by 743 (5 self)
 Add to MetaCart
. The paper puts particular emphasis on the unified exposition of its mathematical and algorithmic properties. Finally, the paper provides the first comprehensive bibliography on Voronoi diagrams and related structures.
Singularity Detection And Processing With Wavelets
 IEEE Transactions on Information Theory
, 1992
"... Most of a signal information is often found in irregular structures and transient phenomena. We review the mathematical characterization of singularities with Lipschitz exponents. The main theorems that estimate local Lipschitz exponents of functions, from the evolution across scales of their wavele ..."
Abstract

Cited by 604 (13 self)
 Add to MetaCart
Most of a signal information is often found in irregular structures and transient phenomena. We review the mathematical characterization of singularities with Lipschitz exponents. The main theorems that estimate local Lipschitz exponents of functions, from the evolution across scales
On the Selfsimilar Nature of Ethernet Traffic (Extended Version)
, 1994
"... We demonstrate that Ethernet LAN traffic is statistically selfsimilar, that none of the commonly used traffic models is able to capture this fractallike behavior, that such behavior has serious implications for the design, control, and analysis of highspeed, cellbased networks, and that aggrega ..."
Abstract

Cited by 2212 (46 self)
 Add to MetaCart
discussion of the underlying mathematical and statistical properties of selfsimilarity and their relationship with actual network behavior. We also present traffic models based on selfsimilar stochastic processes that provide simple, accurate, and realistic descriptions of traffic scenarios expected during
The LargeScale Organization of Metabolic Networks
, 2000
"... In a cell or microorganism the processes that generate mass, energy, information transfer, and cell fate specification are seamlessly integrated through a complex network of various cellular constituents and reactions. However, despite the key role these networks play in sustaining various cellular ..."
Abstract

Cited by 608 (7 self)
 Add to MetaCart
functions, their largescale structure is essentially unknown. Here we present the first systematic comparative mathematical analysis of the metabolic networks of 43 organisms representing all three domains of life. We show that, despite significant variances in their individual constituents and pathways
Results 1  10
of
2,705,958