Sciweavers

254 search results - page 34 / 51
» Binary amiable Words
Sort
View
APPROX
2008
Springer
190views Algorithms» more  APPROX 2008»
15 years 8 months ago
The Complexity of Local List Decoding
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
Dan Gutfreund, Guy N. Rothblum
ICML
2010
IEEE
15 years 7 months ago
Structured Output Learning with Indirect Supervision
We present a novel approach for structure prediction that addresses the difficulty of obtaining labeled structures for training. We observe that structured output problems often h...
Ming-Wei Chang, Vivek Srikumar, Dan Goldwasser, Da...
ICCS
2009
Springer
15 years 3 months ago
Dynamic Software Updates for Accelerating Scientific Discovery
Distributed parallel applications often run for hours or even days before arriving to a result. In the case of such long-running programs, the initial requirements could change aft...
Dong Kwan Kim, Myoungkyu Song, Eli Tilevich, Calvi...
AI
2011
Springer
15 years 1 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
JUCS
2006
107views more  JUCS 2006»
15 years 6 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig