Results 1  10
of
4,503,902
What Can Economists Learn from Happiness Research?
 FORTHCOMING IN JOURNAL OF ECONOMIC LITERATURE
, 2002
"... Happiness is generally considered to be an ultimate goal in life; virtually everybody wants to be happy. The United States Declaration of Independence of 1776 takes it as a selfevident truth that the “pursuit of happiness” is an “unalienable right”, comparable to life and liberty. It follows that e ..."
Abstract

Cited by 517 (24 self)
 Add to MetaCart
Happiness is generally considered to be an ultimate goal in life; virtually everybody wants to be happy. The United States Declaration of Independence of 1776 takes it as a selfevident truth that the “pursuit of happiness” is an “unalienable right”, comparable to life and liberty. It follows
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 887 (22 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
HumanComputer Interaction
, 1993
"... www.bcshci.org.uk Find out what happened at HCI2004 Interacting with … music aeroplanes petrol pumps Published by the British HCI Group • ISSN 1351119X 1 ..."
Abstract

Cited by 582 (18 self)
 Add to MetaCart
www.bcshci.org.uk Find out what happened at HCI2004 Interacting with … music aeroplanes petrol pumps Published by the British HCI Group • ISSN 1351119X 1
Computer support for knowledgebuilding communities
 The Journal of the Learning Sciences
, 1994
"... Nobody wants to use technology to recreate education as it is, yet there is not much to distinguish what goes on in most computersupported classrooms versus traditional classrooms. Kay (1991) has suggested that the phenomenon of reframing innovations to recreate the familiar is itself commonplace. ..."
Abstract

Cited by 593 (4 self)
 Add to MetaCart
Nobody wants to use technology to recreate education as it is, yet there is not much to distinguish what goes on in most computersupported classrooms versus traditional classrooms. Kay (1991) has suggested that the phenomenon of reframing innovations to recreate the familiar is itself commonplace
A New Kind of Science
, 2002
"... “Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical amplit ..."
Abstract

Cited by 850 (0 self)
 Add to MetaCart
“Somebody says, ‘You know, you people always say that space is continuous. How do you know when you get to a small enough dimension that there really are enough points in between, that it isn’t just a lot of dots separated by little distances? ’ Or they say, ‘You know those quantum mechanical
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum
Sequence Logos: A New Way to Display Consensus Sequences
 Nucleic Acids Res
, 1990
"... INTRODUCTION A logo is "a single piece of type bearing two or more usually separate elements" [1]. In this paper, we use logos to display aligned sets of sequences. Sequence logos concentrate the following information into a single graphic [2]: 1. The general consensus of the sequences. ..."
Abstract

Cited by 638 (27 self)
 Add to MetaCart
INTRODUCTION A logo is "a single piece of type bearing two or more usually separate elements" [1]. In this paper, we use logos to display aligned sets of sequences. Sequence logos concentrate the following information into a single graphic [2]: 1. The general consensus of the sequences
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract

Cited by 518 (5 self)
 Add to MetaCart
Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 500 (0 self)
 Add to MetaCart
divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
is about logics for reasoning about programs, in particular for proving equivalence of programs. Following a consolidated tradition in theoretical computer science we identify programs with the closed terms, possibly containing extra constants, corresponding to some features of the programming language
Results 1  10
of
4,503,902