Sciweavers

1003 search results - page 90 / 201
» It's life Jim, but not as we know it!
Sort
View
TAPOS
1998
93views more  TAPOS 1998»
15 years 1 months ago
Object Acquaintance Selection and Binding
Large object-oriented systems have, at least, four characteristics that complicate object communication, i.e the system is distributed and contains large numbers, e.g. thousands, ...
Jan Bosch
CSCW
2012
ACM
13 years 9 months ago
Predicting tie strength in a new medium
We have friends we consider very close and acquaintances we barely know. The social sciences use the term tie strength to denote this differential closeness with the people in our...
Eric Gilbert
PODC
2005
ACM
15 years 7 months ago
Proof labeling schemes
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
Amos Korman, Shay Kutten, David Peleg
EDM
2009
116views Data Mining» more  EDM 2009»
14 years 11 months ago
Determining the Significance of Item Order In Randomized Problem Sets
Researchers who make tutoring systems would like to know which sequences of educational content lead to the most effective learning by their students. The majority of data collecte...
Zachary A. Pardos, Neil T. Heffernan
IEEEIAS
2009
IEEE
14 years 11 months ago
On Security Notions for Verifiably Encrypted Signature
First we revisit three - BGLS, MBGLS and GZZ verifiably encrypted signature schemes [2, 3, 6]. We find that they are all not strong unforgeable.We remark that the notion of existen...
Xu An Wang, Xiaoyuan Yang, Qingquan Peng