Results 1 - 10 of 31,971

A Simple Proof of the Restricted Isometry Property for Random Matrices

by Richard Baraniuk, Mark Davenport, Ronald DeVore, Michael Wakin - 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

Least angle regression

by Bradley Efron, Trevor Hastie, Iain Johnstone, Robert Tibshirani , 2004
"... The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to s ..."
Abstract - Cited by 1326 (37 self) - Add to MetaCart
to select a parsimonious set for the efficient prediction of a response variable. Least Angle Regression (LARS), a new model selection algorithm, is a useful and less greedy version of traditional forward selection methods. Three main properties are derived: (1) A simple modification of the LARS algorithm

Convergent Tree-reweighted Message Passing for Energy Minimization

by Vladimir Kolmogorov - ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI) , 2006
"... Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33]- tree-reweighted max-product message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy ..."
Abstract - Cited by 489 (16 self) - Add to MetaCart
on the energy. However, the algorithm is not guaranteed to increase this bound- it may actually go down. In addition, TRW does not always converge. We develop a modification of this algorithm which we call sequential tree-reweighted message passing. Its main property is that the bound is guaranteed

Compositional Model Checking

by E. M. Clarke, D. E. Long, K. L. Mcmillan , 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 3252 (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

The ordinal numbers

by Grzegorz Bancerek - Journal of Formalized Mathematics , 1989
"... Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here Cantor-Bernstein theorem and oth ..."
Abstract - Cited by 731 (68 self) - Add to MetaCart
Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here Cantor-Bernstein theorem

Securing ad hoc networks

by Lidong Zhou, Zygmunt J. Haas
"... Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operation ..."
Abstract - Cited by 1064 (15 self) - Add to MetaCart
-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we study the threats an ad hoc

AgentSpeak(L): BDI Agents speak out in a logical computable language

by Anand S. Rao , 1996
"... Belief-Desire-Intention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem-prov ..."
Abstract - Cited by 514 (2 self) - Add to MetaCart
Belief-Desire-Intention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem

UPPAAL in a Nutshell

by Kim G. Larsen, Paul Pettersson, Wang Yi , 1997
"... . This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior, ..."
Abstract - Cited by 662 (51 self) - Add to MetaCart
. This paper presents the overall structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior

Climate and atmospheric history of the past 420,000 years from the Vostok ice core,

by J R Petit , J Jouzel , D Raynaud , N I Barkov , J.-M Barnola , I Basile , M Bender , J Chappellaz , M Davisk , G Delaygue , M Delmotte , V M Kotlyakov , M Legrand , V Y Lipenkov , C Lorius , L Pé , C Ritz , E Saltzmank , M Stievenard - Antarctica. Nature , 1999
"... Antarctica has allowed the extension of the ice record of atmospheric composition and climate to the past four glacial-interglacial cycles. The succession of changes through each climate cycle and termination was similar, and atmospheric and climate properties oscillated between stable bounds. Inte ..."
Abstract - Cited by 716 (15 self) - Add to MetaCart
Antarctica has allowed the extension of the ice record of atmospheric composition and climate to the past four glacial-interglacial cycles. The succession of changes through each climate cycle and termination was similar, and atmospheric and climate properties oscillated between stable bounds

MicroRNA genes are transcribed by RNA polymerase II

by Yoontae Lee, Minju Kim, Jinju Han, Kyu-hyun Yeom, Sanghyuk Lee, Sung Hee Baek, V Narry Kim - EMBO J , 2004
"... MicroRNAs (miRNAs) constitute a large family of noncod-ing RNAs that function as guide molecules in diverse gene silencing pathways. Current efforts are focused on the regulatory function of miRNAs, while little is known about how these unusual genes themselves are regulated. Here we present the fir ..."
Abstract - Cited by 491 (8 self) - Add to MetaCart
the first direct evidence that miRNA genes are transcribed by RNA polymerase II (pol II). The primary miRNA transcripts (pri-miRNAs) contain cap structures as well as poly(A) tails, which are the unique properties of class II gene transcripts. The treatment of human cells with a-amanitin decreased the level
Results 1 - 10 of 31,971