Sciweavers

1728 search results - page 61 / 346
» Social Computing: Fundamentals and applications
Sort
View
FOSSACS
2006
Springer
13 years 11 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
CAP
2010
13 years 2 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu

Lab
667views
14 years 4 months ago
Digital Systems and Media Computing Laboratory - DSMC
The Digital Systems and Media Computing Laboratory (DSMC Lab) was established in the end of 2002 and is located in Patras, Greece. DSMC operates under the School of Sciences and Te...
CHI
2010
ACM
14 years 2 months ago
Embodied social proxy: mediating interpersonal connection in hub-and-satellite teams
Current business conditions have given rise to distributed teams that are mostly collocated except for one remote member. These “hub-and-satellite” teams face the challenge of...
Gina Venolia, John C. Tang, Ruy Cervantes, Sara Bl...