Sciweavers

3702 search results - page 39 / 741
» All Pairings Are in a Group
Sort
View
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
15 years 4 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
HICSS
2002
IEEE
109views Biometrics» more  HICSS 2002»
15 years 5 months ago
Group Cohesiveness and Extrinsic Motivation in Virtual Groups: Lessons from an Action Case Study of Electronic Brainstorming
One form of group support system that has received much attention from cross-disciplinary research is electronic brainstorming (EBS). While it is generally held that group cohesiv...
Dick Stenmark
110
Voted
DM
2000
108views more  DM 2000»
15 years 9 days ago
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
Patrick Dehornoy
CSCW
2008
ACM
15 years 2 months ago
Linguistic mimicry and trust in text-based CMC
This study examines the relationship between linguistic mimicry and trust establishment in a text-chat environment. Twenty-six participant pairs engaged in a social dilemma invest...
Lauren E. Scissors, Alastair J. Gill, Darren Gergl...
CRIWG
2004
15 years 1 months ago
Empirical Evaluation of Collaborative Support for Distributed Pair Programming
Pair programming is an Extreme Programming (XP) practice where two programmers work on a single computer to produce an artifact. Empirical evaluations have provided evidence that t...
Jesús Favela, Hiroshi Natsu, Cynthia B. P&e...