Sciweavers

106 search results - page 21 / 22
» Probabilistically Checkable Arguments
Sort
View
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 10 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
ACL
1998
13 years 10 months ago
Machine Translation with a Stochastic Grammatical Channel
We introduce a stochastic grammatical channel model for machine translation, that synthesizes several desirable characteristics of both statistical and grammatical machine transla...
Dekai Wu, Hongsing Wong
TIT
1998
96views more  TIT 1998»
13 years 8 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth
IPL
2010
98views more  IPL 2010»
13 years 7 months ago
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...
Nathan Keller, Stephen D. Miller
IJRR
2011
159views more  IJRR 2011»
13 years 3 months ago
Learning visual representations for perception-action systems
We discuss vision as a sensory modality for systems that effect actions in response to perceptions. While the internal representations informed by vision may be arbitrarily compl...
Justus H. Piater, Sébastien Jodogne, Renaud...