๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Varieties of sameness: the impact of relational complexity on perceptual comparisons

โœ Scribed by James K. Kroger; Keith J. Holyoak; John E. Hummel


Publisher
Wiley (Blackwell Publishing)
Year
2004
Tongue
English
Weight
276 KB
Volume
28
Category
Article
ISSN
0364-0213

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the complexity of inference about pro
โœ Manfred Jaeger ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 120 KB

We investigate the complexity of probabilistic inference from knowledge bases that encode probability distributions on finite domain relational structures. Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance. We obtain the result tha

On the impact of sense of direction on m
โœ Paola Flocchini; Bernard Mans; Nicola Santoro ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 859 KB

In this paper, we prove a general result on the impact of sense of direction. We show that, in arbitrary graphs, any sense of direction has a dramatic effect on the communication complexity of several important distributed problems: Broadcast, Depth First Traversal, Election, and Spanning Tree Const

The Impact of Same-Sex LMX Dyads on Perf
โœ Arup Varma; Linda K. Stroh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB ๐Ÿ‘ 2 views

## Abstract Numerous studies have found that supervisors rate women lower than men for similar levels of performance, suggesting that for female employees, performance alone may not be able to guarantee fair ratings. What is not clear is whether this disparity is a function of the gender compositio

Impact of communications on the complexi
โœ E. Bampis; J.C. Konig; D. Trystram ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

This paper presents an extension to the complexity analysis of parallel algorithms on MIMD computers with a shared-memory system which takes into account communications. This analysis shows that the well-known asymptotically optimal results are insufficient because we show that the overhead is in O(