Sciweavers

1859 search results - page 208 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
HICSS
2003
IEEE
215views Biometrics» more  HICSS 2003»
15 years 10 months ago
A Field Study of Use of Synchronous Chat in Online Courses
A field study of Computer Mediated Communication (CMC) as used in higher education asks the questions, "Will students take part in synchronous chat sessions if they are sched...
David H. Spencer, Starr Roxanne Hiltz
FSS
2010
147views more  FSS 2010»
15 years 3 months ago
A divide and conquer method for learning large Fuzzy Cognitive Maps
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
Wojciech Stach, Lukasz A. Kurgan, Witold Pedrycz
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 11 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
136
Voted
ICTAI
2008
IEEE
15 years 11 months ago
Veritas: Combining Expert Opinions without Labeled Data
We consider a variation of the problem of combining expert opinions for the situation in which there is no ground truth to use for training. Even though we don’t have labeled da...
Sharath R. Cholleti, Sally A. Goldman, Avrim Blum,...
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 9 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore