Systolic arrays and stack decoding

The application of systolic priority queues to the sequential stack decoding algorithm is discussed in a review of the work of K. Yao and C. Y. Chang. Using a systolic array architecture, one can significantly improve the performance of such algorithms at high signal-to-noise ratios

On Such a Full Sea of Novels: An Interview with Chang-rae Lee

An interview with author Chang-rae Lee

Ante una nueva historia y filosofía de las ciencias: Hasok Chang y su propuesta de ciencia complementaria

El presente trabajo señalará los elementos críticos de Chang en este sentido y las ventajas de su modelo. Destacará cómo sería posible testear a través de él la solidez y adecuación de algunas propuestas epistemólogicas, a través del develamiento del proceso histórico de construcción de verdades científicas que penetraron el sentido común educado. Presentaré aquí el modo de concebir el desarrollo de la historia y la filosofía de las ciencias, propuesto por Hasok Chang. El alcance del texto es, entonces, modesto. Sin embargo, y dado que creo que además de nueva, su concepción es casi desconocida por estos lados valoro la tarea como útil. Trataré de esbozar los caracteres de su ciencia complementaria del modo más breve posible, allí mismo se observará la crítica implícita que al sistema científico Chang realiza y luego de determinadas estas dos cosas, pasaré a señalar por qué esta propuesta me parece valiosa

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

Cook and Krajíček [9] have obtained the following Karp-Lipton result in bounded arithmetic: if the theory proves , then collapses to , and this collapse is provable in . Here we show the converse implication, thus answering an open question from [9]. We obtain this result by formalizing in a hard/easy argument of Buhrman, Chang, and Fortnow [3]. In addition, we continue the investigation of propositional proof systems using advice, initiated by Cook and Krajíček [9]. In particular, we obtain several optimal and even p-optimal proof systems using advice. We further show that these p-optimal systems are equivalent to natural extensions of Frege systems

Text to 3D Scene Generation with Rich Lexical Grounding

The ability to map descriptions of scenes to 3D geometric representations has many applications in areas such as art, education, and robotics. However, prior work on the text to 3D scene generation task has used manually specified object categories and language that identifies them. We introduce a dataset of 3D scenes annotated with natural language descriptions and learn from this data how to ground textual descriptions to physical objects. Our method successfully grounds a variety of lexical terms to concrete referents, and we show quantitatively that our method improves 3D scene generation over previous work using purely rule-based methods. We evaluate the fidelity and plausibility of 3D scenes generated with our grounding approach through human judgments. To ease evaluation on this task, we also introduce an automated metric that strongly correlates with human judgments.Comment: 10 pages, 7 figures, 3 tables. To appear in ACL-IJCNLP 201