3625 search results - page 252 / 725 » On choosing |
200
click to vote
ICML
2006
IEEE
16 years 8 months ago
2006
IEEE
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
200
click to vote
CHI
2004
ACM
16 years 7 months ago
2004
ACM
We investigate the prevalence and learning impact of different types of off-task behavior in classrooms where students are using intelligent tutoring software. We find that within...
206
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
204
click to vote
OSDI
2008
ACM
16 years 7 months ago
2008
ACM
Library-based record and replay tools aim to reproduce an application's execution by recording the results of selected functions in a log and during replay returning the resu...
238
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...