Results 1  10
of
8,068
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
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NPhard, because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds
Functions and their basic properties
 JOURNAL OF FORMALIZED MATHEMATICS
, 2003
"... The definitions of the mode Function and the graph of a function are introduced. The graph of a function is defined to be identical with the function. The following concepts are also defined: the domain of a function, the range of a function, the identity function, the composition of functions, the ..."
Abstract

Cited by 1336 (32 self)
 Add to MetaCart
, the 11 function, the inverse function, the restriction of a function, the image and the inverse image. Certain basic facts about functions and the notions defined in the article are proved.
Learning and development in neural networks: The importance of starting small
 Cognition
, 1993
"... It is a striking fact that in humans the greatest learnmg occurs precisely at that point in time childhood when the most dramatic maturational changes also occur. This report describes possible synergistic interactions between maturational change and the ability to learn a complex domain (language ..."
Abstract

Cited by 531 (17 self)
 Add to MetaCart
succeeds only when networks begin with limited working memory and gradually ‘mature ’ to the adult state. This result suggests that rather than being a limitation, developmental restrictions on resources may constitute a necessary prerequisite for mastering certain complex domains. Specifically, successful
Applying New Scheduling Theory to Static Priority PreEmptive Scheduling
 Software Engineering Journal
, 1993
"... The paper presents exact schedulability analyses for realtime systems scheduled at runtime with a static priority preemptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) release ..."
Abstract

Cited by 448 (64 self)
 Add to MetaCart
The paper presents exact schedulability analyses for realtime systems scheduled at runtime with a static priority preemptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions
Multiobjective Evolutionary Algorithms: Analyzing the StateoftheArt
, 2000
"... Solving optimization problems with multiple (often conflicting) objectives is, generally, a very difficult goal. Evolutionary algorithms (EAs) were initially extended and applied during the mideighties in an attempt to stochastically solve problems of this generic class. During the past decade, ..."
Abstract

Cited by 440 (7 self)
 Add to MetaCart
, a variety of multiobjective EA (MOEA) techniques have been proposed and applied to many scientific and engineering applications. Our discussion's intent is to rigorously define multiobjective optimization problems and certain related concepts, present an MOEA classification scheme
Adjustable robust solutions of uncertain linear programs
, 2004
"... We consider linear programs with uncertain parameters, lying in some prescribed uncertainty set, where part of the variables must be determined before the realization of the uncertain parameters (“nonadjustable variables”), while the other part are variables that can be chosen after the realization ..."
Abstract

Cited by 370 (12 self)
 Add to MetaCart
(RC), however, in most cases the ARC is computationally intractable (NPhard). This difficulty is addressed by restricting the adjustable variables to be affine functions of the uncertain data. The ensuing Affinely Adjustable Robust Counterpart (AARC) problem is then shown to be, in certain important
Uniform decision problems for certain restricted classes of finite monoidpresentations  A survey on recent undecidability results
, 1997
"... It is wellknown that many decision problems are undecidable in general for the class of all finite monoidpresentations. Here we consider the question of which of these problems remain undecidable even for very restricted classes of finite monoidpresentations. The restrictions we are interested in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is wellknown that many decision problems are undecidable in general for the class of all finite monoidpresentations. Here we consider the question of which of these problems remain undecidable even for very restricted classes of finite monoidpresentations. The restrictions we are interested
On the (im)possibility of obfuscating programs
 Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract

Cited by 348 (24 self)
 Add to MetaCart
) program P ∈ P, no efficient algorithm can reconstruct P (or even distinguish a certain bit in the code from random) except with negligible probability. We extend our impossibility result in a number of ways, including even obfuscators that (a) are not necessarily computable in polynomial time, (b) only
Bethe Ansatz for Quantum Strings
, 2004
"... We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed allloop gauge theory asymptotic Bethe ansatz by add ..."
Abstract

Cited by 281 (16 self)
 Add to MetaCart
We propose Bethe equations for the diagonalization of the Hamiltonian of quantum strings on AdS5×S 5 at large string tension and restricted to certain large charge states from a closed su(2) subsector. The ansatz differs from the recently proposed allloop gauge theory asymptotic Bethe ansatz
Results 1  10
of
8,068