Sciweavers

811 search results - page 61 / 163
» When Novelty Is Not Enough
Sort
View
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 11 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
AAAI
2004
13 years 11 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
NAACL
2003
13 years 11 months ago
Supervised and unsupervised PCFG adaptation to novel domains
This paper investigates adapting a lexicalized probabilistic context-free grammar (PCFG) to a novel domain, using maximum a posteriori (MAP) estimation. The MAP framework is gener...
Brian Roark, Michiel Bacchiani
CASCON
1996
120views Education» more  CASCON 1996»
13 years 11 months ago
Communication costs in code and design reviews: an empirical study
Software development managers strive to control all of the factors that might impact the success of their projects. However, not all of these factors have been identified, much le...
Carolyn B. Seaman
EUROPAR
2010
Springer
13 years 10 months ago
Transactional Mutex Locks
Mutual exclusion locks limit concurrency but offer low latency. Software transactional memory (STM) typically has higher latency, but scales well. In this paper we propose transac...
Luke Dalessandro, David Dice, Michael L. Scott, Ni...