Sciweavers

6018 search results - page 1182 / 1204
» Factored Translation Models
Sort
View
FAST
2004
15 years 1 months ago
Circus: Opportunistic Block Reordering for Scalable Content Servers
Whole-file transfer is a basic primitive for Internet content dissemination. Content servers are increasingly limited by disk arm movement given the rapid growth in disk density, ...
Stergios V. Anastasiadis, Rajiv Wickremesinghe, Je...
FLAIRS
2006
15 years 1 months ago
The ASSISTment Builder: Towards an Analysis of Cost Effectiveness of ITS Creation
Intelligent Tutoring Systems, while effective at producing student learning [2,7], are notoriously costly to construct [1,9], and require PhD level experience in cognitive science...
Neil T. Heffernan, Terrence E. Turner, Abraao L. N...
NSDI
2004
15 years 1 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
15 years 1 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
UAI
2003
15 years 1 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
« Prev « First page 1182 / 1204 Last » Next »