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

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 10

Certified by:

by Anil Srinivasa Chakravarthy, Kenneth B. Haase, Anil Srinivasa Chakravarthy , 1995
"... The rapid growth of on-line information on the Internet and other platforms presents a great chal-lenge to information retrieval systems. However, improvements in information retrieval technol-ogy have not kept pace with the growth in available information. State-of-the-art information retrieval sys ..."
Abstract - Add to MetaCart
on literal equivalence. This dissertation presents a framework for generalization through the incorporation of semantic knowledge into information retrieval systems. The semantic knowledge is extracted from an online Webster's dictionary and a thesaurus named WordNet. The use of semantic knowledge

Combinatorial Algorithms for Compressed Sensing

by Graham Cormode - In Proc. of SIROCCO , 2006
"... Abstract — In sparse approximation theory, the fundamental problem is to reconstruct a signal A ∈ R n from linear measurements 〈A, ψi 〉 with respect to a dictionary of ψi’s. Recently, there is focus on the novel direction of Compressed Sensing [1] where the reconstruction can be done with very few—O ..."
Abstract - Cited by 113 (1 self) - Add to MetaCart
—O(k log n)— linear measurements over a modified dictionary if the signal is compressible, that is, its information is concentrated in k coefficients with the original dictionary. In particular, these results [1], [2], [3] prove that there exists a single O(k log n) × n measurement matrix such that any

A TLA+ Proof System

by Kaustuv Chaudhuri, Damien Doligez, Leslie Lamport, Stephan Merz
"... We describe an extension to the TLA + specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of hierarchically structured proofs. The PM transla ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
+ in Isabelle/Pure. The proof obligations for a complete TLA +2 proof can also be used to certify the theorem in Isabelle/TLA+.

Zero-Knowledge Proofs with Witness Elimination

by Aggelos Kiayias, Hong-sheng Zhou
"... Abstract. Zero-knowledge proofs with witness elimination are proto-cols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction provided that the witness is valid for a given statement and additionally the witness does not belong to a set of eliminated ..."
Abstract - Add to MetaCart
multitude of witnesses that may attest to its validity. A number of interesting issues arise in the design of such protocols that include whether a protocol transcript enables the verifier to test for wit-ness after termination (something akin to an “offline dictionary attack”) and whether the prover should

and

by Beta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski , 2015
"... Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on adva ..."
Abstract - Add to MetaCart
Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on advanced type-theoretic machinery that is not easily integrated into established theorem provers. We present Mtac, a lightweight but powerful extension to Coq that supports dependently typed tactic programming. Mtac tactics have access to all the features of ordinary Coq programming, as well as a new set of typed tactical primitives. We avoid the need to touch the trusted kernel type-checker of Coq by encapsulating uses of these new tactical primitives in a monad, and instrumenting Coq so that it executes monadic tactics during type inference. 1

AND MATHEMATICAL ENGINEERING

by Madeleine Udell, Professor Lester Mackey , 2015
"... ii ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Volume I: Computer Science and Software Engineering

by Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas, Allen Tucker, Teo Gonzales, Jorge L. Diaz-herrera, Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas , 2013
"... Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations in Sc ..."
Abstract - Add to MetaCart
Algebraic algorithms deal with numbers, vectors, matrices, polynomials, for-mal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation with matri-ces and polynomials is fundamental for modern computations in Sciences and

ALGEBRAIC ALGORITHMS1

by Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas, Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas , 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up- ..."
Abstract - Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up-

IEEE TRANSACTIONS ON INFORMATION THEORY (SUBMITTED) 1 Noisy Matrix Completion under Sparse Factor Models

by Akshay Soni, Swayambhoo Jain, Jarvis Haupt, Stefano Gonella
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

under a Creative Commons Attribution Non-Commercial No Derivatives

by Sira Gonzalez, Deparment Of Electrical, Electronic Engineering , 2013
"... the condition that they attribute it, that they do not use it for commercial purposes and that they do not alter, transform or build upon it. For any reuse or redistribution, researchers must make clear to others the licence terms of this work. ..."
Abstract - Add to MetaCart
the condition that they attribute it, that they do not use it for commercial purposes and that they do not alter, transform or build upon it. For any reuse or redistribution, researchers must make clear to others the licence terms of this work.
Results 1 - 10 of 10
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