Results 1  10
of
3,130
Reasoning the fast and frugal way: Models of bounded rationality.
 Psychological Review,
, 1996
"... Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors have ..."
Abstract

Cited by 611 (30 self)
 Add to MetaCart
Humans and animals make inferences about the world under limited time and knowledge. In contrast, many models of rational inference treat the mind as a Laplacean Demon, equipped with unlimited time, knowledge, and computational might. Following H. Simon's notion of satisncing, the authors
On Lines and Joints
, 2009
"... Let L be a set of n lines in R d, for d ≥ 3. A joint of L is a point incident to at least d lines of L, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum possible number of joints of L is Θ(n d/(d−1)). For d = 3, this is a considerable simplifica ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
simplification of the orignal algebraic proof of Guth and Katz [9], and of the followup simpler proof of Elekes et al. [6]. Some extensions, e.g., to the case of joints of algebraic curves, are also presented.
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
∪{D}. Thus during the bottomup search for a cutfree proof contexts, represented as the lefthand side of intuitionistic sequents, grow as stacks. While such an intuitionistic notion of context provides for elegant specifications of many computations, contexts can be made more expressive and flexible
A simpler approach to matrix completion
 the Journal of Machine Learning Research
"... This paper provides the best bounds to date on the number of randomly sampled entries required to reconstruct an unknown low rank matrix. These results improve on prior work by Candès and Recht [4], Candès and Tao [7], and Keshavan, Montanari, and Oh [18]. The reconstruction is accomplished by minim ..."
Abstract

Cited by 158 (6 self)
 Add to MetaCart
in the singular value decomposition. The proof of this assertion is short, self contained, and uses very elementary analysis. The novel techniques herein are based on recent work in quantum information theory.
ORDERINGS FOR TERMREWRITING SYSTEMS
, 1982
"... Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree Theorem ..."
Abstract

Cited by 294 (24 self)
 Add to MetaCart
Methods of proving that a termrewriting system terminates are presented. They are based on the intuitive notion of 'simplification orderings'. orderings in which any term that is syntactically simpler than another is smaller than the other. M a consequence of Kruskal's Tree
IDENTIFICATION OF GENETIC NETWORKS FROM A SMALL NUMBER OF GENE EXPRESSION PATTERNS UNDER THE BOOLEAN NETWORK MODEL
 PACIFIC SYMPOSIUM ON BIOCOMPUTING 4:1728 (1999)
, 1999
"... ... for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient ..."
Abstract

Cited by 254 (17 self)
 Add to MetaCart
in order to infer the original Boolean network correctly. This paper gives a mathematical proof for their observation. Precisely, this paper devises a much simpler algorithm for the same problem and proves that, if the indegree of each node (i.e., the number of input nodes to each node) is bounded by a
A Simpler Proof Theory for Nominal Logic
 In FOSSACS 2005, number 3441 in LNCS
, 2005
"... Nominal logic is a variant of firstorder logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the newquantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made ..."
Abstract

Cited by 29 (11 self)
 Add to MetaCart
structural and metatheoretic properties, including cutelimination, consistency, and conservativity with respect to Pitts' axiomatization of nominal logic; these proofs are considerably simpler for our system. 1
Efficient threshold signature, multisignature and blind signature schemes based on the GapDiffieHellmanGroup signature scheme
 PROCEEDINGS OF PKC 2003, VOLUME 2567 OF LNCS
, 2003
"... We propose a robust proactive threshold signature scheme, a multisignature scheme and a blind signature scheme which work in any Gap DiffieHellman (GDH) group (where the Computational DiffieHellman problem is hard but the Decisional DiffieHellman problem is easy). Our constructions are based on t ..."
Abstract

Cited by 191 (0 self)
 Add to MetaCart
on the recently proposed GDH signature scheme of Boneh et al. [8]. Due to the instrumental structure of GDH groups and of the base scheme, it turns out that most of our constructions are simpler, more efficient and have more useful properties than similar existing constructions. We support all the proposed
Accurate Summation: Towards a Simpler and Formal Proof
"... This paper provides a simpler proof of the “accurate summation ” algorithm proposed by Demmel and Hida in [1]. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computerchecked proof of DemmelHida’s algo ..."
Abstract
 Add to MetaCart
This paper provides a simpler proof of the “accurate summation ” algorithm proposed by Demmel and Hida in [1]. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computerchecked proof of Demmel
Results 1  10
of
3,130