Sciweavers

716 search results - page 37 / 144
» Algorithmic Issues in Coding Theory
Sort
View
COLT
2008
Springer
15 years 4 months ago
Learning from Collective Behavior
Inspired by longstanding lines of research in sociology and related fields, and by more recent largepopulation human subject experiments on the Internet and the Web, we initiate a...
Michael Kearns, Jennifer Wortman
AIED
2007
Springer
15 years 8 months ago
Beyond the code-and-count analysis of tutoring dialogues
In this paper, we raise a methodological issue concerning the empirical analysis of tutoring dialogues: The frequencies of tutoring moves do not necessarily reveal their causal efï...
Stellan Ohlsson, Barbara Di Eugenio, Bettina Chow,...
TCOM
2010
111views more  TCOM 2010»
15 years 24 days ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
137
Voted
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
15 years 23 days ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
15 years 8 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain speciï¬c operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson