Results 1  10
of
3,975
Some Surprising Properties Of Power Indices
, 1999
"... While it is troubling when power index values change with the index, the problem is more severe; different indices can generate radically di#erent rankings; e.g., a 15player game exists with over a trillion different strict index rankings of the players. In contrast, for each number of players ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
While it is troubling when power index values change with the index, the problem is more severe; different indices can generate radically di#erent rankings; e.g., a 15player game exists with over a trillion different strict index rankings of the players. In contrast, for each number of players certain indices always share the same ranking; e.g., the Shapley and Banzhaf rankings agree with three players, but they can even have opposite rankings with more players. It is shown how index outcomes can be sensitive to assumptions and when players leave a game.
SURPRISING PROPERTIES OF CENTRALISERS IN CLASSICAL LIE ALGEBRAS
, 2008
"... Let g be a classical Lie algebra, i.e., either gl n, sp n, or son and let e be a nilpotent element of g. We study various properties of centralisers ge. The first four sections deal with rather elementary questions, like the centre of ge, commuting varieties associated with ge, or centralisers of ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Let g be a classical Lie algebra, i.e., either gl n, sp n, or son and let e be a nilpotent element of g. We study various properties of centralisers ge. The first four sections deal with rather elementary questions, like the centre of ge, commuting varieties associated with ge, or centralisers
I A SURPRISING PROPERTY OF SOME REGULAR POLYTOPESI
"... NATIONAL BUREAU OF STANDARDS 1963A ~v w jiw.ww w. pr r Z WC..A. ..."
A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks
, 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosenmessage attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract

Cited by 959 (40 self)
 Add to MetaCart
in a way that depends on the signatures of previously chosen messages) can not later forge the signature of even a single additional message. This may be somewhat surprising, since the properties of having forgery being equivalent to factoring and being invulnerable to an adaptive chosenmessage attack
Consistency of spectral clustering
, 2004
"... Consistency is a key property of statistical algorithms, when the data is drawn from some underlying probability distribution. Surprisingly, despite decades of work, little is known about consistency of most clustering algorithms. In this paper we investigate consistency of a popular family of spe ..."
Abstract

Cited by 572 (15 self)
 Add to MetaCart
Consistency is a key property of statistical algorithms, when the data is drawn from some underlying probability distribution. Surprisingly, despite decades of work, little is known about consistency of most clustering algorithms. In this paper we investigate consistency of a popular family
On PowerLaw Relationships of the Internet Topology
 IN SIGCOMM
, 1999
"... Despite the apparent randomness of the Internet, we discover some surprisingly simple powerlaws of the Internet topology. These powerlaws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our powerl ..."
Abstract

Cited by 1670 (70 self)
 Add to MetaCart
Despite the apparent randomness of the Internet, we discover some surprisingly simple powerlaws of the Internet topology. These powerlaws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. We show that our power
The Vocabulary Problem in HumanSystem Communication
 COMMUNICATIONS OF THE ACM
, 1987
"... In almost all computer applications, users must enter correct words for the desired objects or actions. For success without extensive training, or in firsttries for new targets, the system must recognize terms that will be chosen spontaneously. We studied spontaneous word choice for objects in five ..."
Abstract

Cited by 562 (8 self)
 Add to MetaCart
in five applicationrelated domains, and found the variability to be surprisingly large. In every case two people favored the same term with probability <0.20. Simulations show how this fundamental property of language limits the success of various design methodologies for vocabularydriven interaction
Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations
, 2005
"... How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include hea ..."
Abstract

Cited by 541 (48 self)
 Add to MetaCart
How do real graphs evolve over time? What are “normal” growth patterns in social, technological, and information networks? Many studies have discovered patterns in static graphs, identifying properties in a single snapshot of a large network, or in a very small number of snapshots; these include
Sticky Information versus Sticky Prices: a Proposal to Replace the New Keynesian Phillips Curve
, 2002
"... This paper examines a model of dynamic price adjustment based on the assumption that information disseminates slowly throughout the population. Compared with the commonly used stickyprice model, this stickyinformation model displays three related properties that are more consistent with accepted v ..."
Abstract

Cited by 489 (25 self)
 Add to MetaCart
This paper examines a model of dynamic price adjustment based on the assumption that information disseminates slowly throughout the population. Compared with the commonly used stickyprice model, this stickyinformation model displays three related properties that are more consistent with accepted
Technological pedagogical content knowledge: A framework for integrating technology in teacher knowledge.
 Teachers College Record,
, 2006
"... Abstract This paper describes a framework for teacher knowledge for technology integration called technological pedagogical content knowledge (originally TPCK, now known as TPACK, or technology, pedagogy, and content knowledge). This framework builds on Lee Shulman's construct of pedagogical c ..."
Abstract

Cited by 420 (19 self)
 Add to MetaCart
properties that make applying them in straightforward ways difficult. Most traditional pedagogical technologies are characterized by specificity (a pencil is for writing, while a microscope is for viewing small objects); stability (pencils, pendulums, and chalkboards have not changed a great deal over time
Results 1  10
of
3,975