• 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 1 - 10 of 1,781
Next 10 →

A randomized protocol for signing contracts

by Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest , 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract - Cited by 599 (11 self) - Add to MetaCart
in piece by piece manner. During such a protocol, one party or another may have a slight advantage; a “fair” protocol keeps this advantage within acceptable limits. We present a new protocol that is fair in the sense that, at any stage in its execution, the conditional probability that one party cannot

Hidden Markov models in computational biology: applications to protein modeling

by Anders Krogh, Michael Brown, I. Saira Mian, Kimmen Sjölander, David Haussler - JOURNAL OF MOLECULAR BIOLOGY , 1994
"... Hidden.Markov Models (HMMs) are applied t.0 the problems of statistical modeling, database searching and multiple sequence alignment of protein families and protein domains. These methods are demonstrated the on globin family, the protein kinase catalytic domain, and the EF-hand calcium binding moti ..."
Abstract - Cited by 655 (39 self) - Add to MetaCart
) perform better in these tests than PROSITE (a dictionary of sites and patterns in proteins). The HMM appecvs to have a slight advantage over PROFILESEARCH in terms of lower rates of false

Suffix arrays: A new method for on-line string searches

by Udi Manber, Gene Myers , 1991
"... A new and conceptually simple data structure, called a suffix array, for on-line string searches is intro-duced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract - Cited by 835 (0 self) - Add to MetaCart
A new and conceptually simple data structure, called a suffix array, for on-line string searches is intro-duced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees

Geographic Concentration in U.S. Manufacturing Industries: A Dartboard Approach

by Glenn Ellison, Edward L. Glaeser - Journal of Political Economy
"... This paper discusses the prevalence of Silicon Valley–style localiza-tions of individual manufacturing industries in the United States. A model in which localized industry-specific spillovers, natural ad-vantages, and pure random chance all contribute to geographic concentration is used to develop a ..."
Abstract - Cited by 599 (16 self) - Add to MetaCart
This paper discusses the prevalence of Silicon Valley–style localiza-tions of individual manufacturing industries in the United States. A model in which localized industry-specific spillovers, natural ad-vantages, and pure random chance all contribute to geographic concentration is used to develop

Tractable reasoning and efficient query answering in description logics: The DL-Lite family

by Diego Calvanese, G. De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati - J. OF AUTOMATED REASONING , 2007
"... We propose a new family of Description Logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract - Cited by 497 (123 self) - Add to MetaCart
TBox reasoning is independent of the ABox, and the part of the process requiring access to the ABox can be carried out by an SQL engine, thus taking advantage of the query optimization strategies provided by current Data Base Management Systems. Since it can be shown that even slight extensions

Cryptographic Limitations on Learning Boolean Formulae and Finite Automata

by Michael Kearns, Leslie Valiant - PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING , 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract - Cited by 347 (14 self) - Add to MetaCart
algorithm is only required to obtain a slight advantage in prediction over random guessing. The techniques used demonstrate an interesting duality between learning and cryptography. We also apply our results to obtain strong intractability results for approximating a generalization of graph coloring.

Geometry Compression

by Michael Deering
"... This paper introduces the concept of Geometry Compression, allowing 3D triangle data to be represented with a factor of 6 to 10 times fewer bits than conventional techniques, with only slight losses in object quality. The technique is amenable to rapid decompression in both software and hardware imp ..."
Abstract - Cited by 350 (0 self) - Add to MetaCart
This paper introduces the concept of Geometry Compression, allowing 3D triangle data to be represented with a factor of 6 to 10 times fewer bits than conventional techniques, with only slight losses in object quality. The technique is amenable to rapid decompression in both software and hardware

Amplification of Slight Probabilistic Advantage at Absolutely No Cost in Space

by Ioan I. Macarie, Joel I. Seiferas , 1998
"... . Nondeterministic Turing acceptors can be viewed as probabilistic acceptors with errors that are one-sided but not significantly bounded. In his seminal work on resource-bounded probabilistic Turing machines [Gi77], Gill showed how to transform such a machine to one that does have a good error boun ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. Nondeterministic Turing acceptors can be viewed as probabilistic acceptors with errors that are one-sided but not significantly bounded. In his seminal work on resource-bounded probabilistic Turing machines [Gi77], Gill showed how to transform such a machine to one that does have a good error bound, at only modest cost in space usage. We describe a simpler transformation that incurs absolutely no cost in space usage. If we change each probabilistic transition to a nondeterministic one, then we get a space-preserving transformation in the opposite direction as well, assuming the definitions are right. Thus the complexity classes are exactly the same, and we have the same space-bound hierarchy for bounded-one-sided-error probabilistic computation that we have for nondeterministic computation. Similarly, we have the same numberof -heads complexity classes and hierarchy for bounded-one-sided-error probabilistic multihead finite automata as for nondeterministic ones. 1. Introduction Wh...

Advantage Updating

by Leemon C. Baird, III , 1993
"... A new algorithm for reinforcement learning, advantage updating, is proposed. Advantage updating is a direct learning technique; it does not require a model to be given or learned. It is incremental, requiring only a constant amount of calculation per time step, independent of the number of possible ..."
Abstract - Cited by 51 (0 self) - Add to MetaCart
are presented indicating that for a simple linear quadratic regulator (LQR) problem with no noise and large time steps, advantage updating learns slightly faster than Q- learning. When there is noise or small time steps, advantage updating learns more quickly than Q-learning by a factor of more than 100

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - Proceedings of the ISMRM 6th Annual Meeting, , 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract - Cited by 193 (3 self) - Add to MetaCart
for excluding voxels from reconstruction. Besides improved accuracy at object edges, the fitting approach has the advantage of not being restricted to regions yielding immediate sensitivity information. It permits extrapolation over a limited range necessary for dealing with slightly varying tissue
Next 10 →
Results 1 - 10 of 1,781
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