• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 5,184
Next 10 →

A generalized uncertainty principle and sparse representation in pairs of bases

by Michael Elad, Alfred M. Bruckstein - IEEE Trans. Inform. Theory , 2002
"... An elementary proof of a basic uncertainty principle concerning pairs of representations of ℜ N vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using pair ..."
Abstract - Cited by 247 (15 self) - Add to MetaCart
An elementary proof of a basic uncertainty principle concerning pairs of representations of ℜ N vectors in different orthonormal bases is provided. The result, slightly stronger than stated before, has a direct impact on the uniqueness property of the sparse representation of such vectors using

Sure independence screening for ultra-high dimensional feature space

by Jianqing Fan, Jinchi Lv , 2006
"... Variable selection plays an important role in high dimensional statistical modeling which nowa-days appears in many areas and is key to various scientific discoveries. For problems of large scale or dimensionality p, estimation accuracy and computational cost are two top concerns. In a recent paper, ..."
Abstract - Cited by 283 (26 self) - Add to MetaCart
Variable selection plays an important role in high dimensional statistical modeling which nowa-days appears in many areas and is key to various scientific discoveries. For problems of large scale or dimensionality p, estimation accuracy and computational cost are two top concerns. In a recent paper

A Tutorial on (Co)Algebras and (Co)Induction

by Bart Jacobs, Jan Rutten - EATCS Bulletin , 1997
"... . Algebraic structures which are generated by a collection of constructors--- like natural numbers (generated by a zero and a successor) or finite lists and trees--- are of well-established importance in computer science. Formally, they are initial algebras. Induction is used both as a definition pr ..."
Abstract - Cited by 271 (36 self) - Add to MetaCart
principle, and as a proof principle for such structures. But there are also important dual "coalgebraic" structures, which do not come equipped with constructor operations but with what are sometimes called "destructor" operations (also called observers, accessors, transition maps

A Static Analyzer for Large Safety-Critical Software

by Bruno Blanchet, Patrick Cousot, Radhia Cousot, Jerome Feret, Laurent Mauborgne, Antoine Mine, David Monniaux, Xavier Rival , 2003
"... We show that abstract interpretation-based static program analysis can be made e#cient and precise enough to formally verify a class of properties for a family of large programs with few or no false alarms. This is achieved by refinement of a general purpose static analyzer and later adaptation to p ..."
Abstract - Cited by 271 (54 self) - Add to MetaCart
to particular programs of the family by the end-user through parametrization. This is applied to the proof of soundness of data manipulation operations at the machine level for periodic synchronous safety critical embedded software. The main novelties are the design principle of static analyzers by refinement

On the Minimal Synchronism Needed for Distributed Consensus

by Danny Dolev, Cynthia Dwork, Larry Stockmeyer - Journal of the ACM , 1987
"... Abstract. Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: A system is viable only if it permits the existence of consensus protocols tolerant to so ..."
Abstract - Cited by 264 (11 self) - Add to MetaCart
of faults that can be tolerated is examined. The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others.

Nowadays the principles of Supply Chain Management

by Jakub Dyntar, Jan Škvor
"... This paper describes an application of Pipe Transportation Simulator (PTS) in oil refinery supply chain modelling. We develop the simulator in Witness simulation software environment using MS Excel for input data loading and outputs upgrading. PTS is particularly suitable for “what-if ” analysis in ..."
Abstract - Add to MetaCart
This paper describes an application of Pipe Transportation Simulator (PTS) in oil refinery supply chain modelling. We develop the simulator in Witness simulation software environment using MS Excel for input data loading and outputs upgrading. PTS is particularly suitable for “what-if ” analysis in the crude oil, fuels or gas supply chains where the products are transported among warehouses and refineries through the pipe lines. To discuss the basic functionality of proposed simulator we employ PTS to simulate a real oil refinery supply chain consisting of 16 warehouses and 3 refineries placed in the Czech Republic and Slovakia. The refineries and warehouses are connected together with 21 pipe lines. PTS is used to verify a plan of fuels movements among warehouses and refineries as well as a plan of repairs of certain pipe lines in the selected time period of the length of 30 days.

The secure remote password protocol

by Thomas Wu - In Proceedings of the 1998 Internet Society Network and Distributed System Security Symposium , 1998
"... This paper presents a new password authentication and key-exchange protocol suitable for authenticating users and exchanging keys over an untrusted network. The new protocol resists dictionary attacks mounted by either passive or active network intruders, allowing, in principle, even weak passphrase ..."
Abstract - Cited by 212 (6 self) - Add to MetaCart
This paper presents a new password authentication and key-exchange protocol suitable for authenticating users and exchanging keys over an untrusted network. The new protocol resists dictionary attacks mounted by either passive or active network intruders, allowing, in principle, even weak

On robust rendezvous for mobile autonomous agents

by Sonia Martínez, Jorge Cortés, Francesco Bullo , 2005
"... This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multi-agent networks in arbitrary di ..."
Abstract - Cited by 203 (21 self) - Add to MetaCart
dimensions under weak requirements on the switching and failing communication topology. The correctness proof relies on proximity graphs and their properties and on a LaSalle Invariance Principle for nondeterministic discrete-time systems.

Entanglement of Formation of an Arbitrary State of Two Qubits

by William K. Wootters , 1998
"... The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state ρ is defined as the minimum average entanglement of a set of pure states constituting a decomposition of ρ. An earlier paper [Phys. Rev ..."
Abstract - Cited by 200 (0 self) - Add to MetaCart
. Rev. Lett. 78, 5022 (1997)] conjectured an explicit formula for the entanglement of formation of a pair of binary quantum objects (qubits) as a function of their density matrix, and proved the formula to be true for a special class of mixed states. The present paper extends the proof to arbitrary

The Proof-Theory and Semantics of Intuitionistic Modal Logic

by Alex K. Simpson , 1994
"... Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic definitions in the ordinary meta-theory of informal classical mathematics. If, however, the same semantic definitions are interpret ..."
Abstract - Cited by 129 (0 self) - Add to MetaCart
are interpreted in an intuitionistic metatheory then the induced modal logics no longer satisfy certain intuitionistically invalid principles. This thesis investigates the intuitionistic modal logics that arise in this way. Natural deduction systems for various intuitionistic modal logics are presented. From one
Next 10 →
Results 11 - 20 of 5,184
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University