Sciweavers

2735 search results - page 162 / 547
» Comparing notions of randomness
Sort
View
ICDT
2005
ACM
124views Database» more  ICDT 2005»
14 years 3 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
TIT
2008
90views more  TIT 2008»
13 years 10 months ago
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
Asaf Cohen, Tsachy Weissman, Neri Merhav
AIED
2009
Springer
14 years 4 months ago
Adapting to Student Uncertainty Improves Tutoring Dialogues
This study shows that affect-adaptive computer tutoring can significantly improve performance on learning efficiency and user satisfaction. We compare two different student uncer...
Katherine Forbes-Riley, Diane J. Litman
ENTCS
2006
117views more  ENTCS 2006»
13 years 10 months ago
A Formalization of Credit and Responsibility Within the GNDC Schema
We formally define a notion of credit and responsibility within the Generalized Non Deducibility on Compositions framework. We investigate the validity of our definitions through ...
Roberto Gorrieri, Fabio Martinelli, Marinella Petr...
CVPR
2010
IEEE
14 years 5 months ago
Rapid Face Recognition Using Hashing
We propose a face recognition approach based on hashing. The approach yields comparable recognition rates with the random 1 approach [18], which is considered the stateof-the-art....
Qinfeng Shi, Hanxi Li, Chunhua Shen