Sciweavers

1670 search results - page 157 / 334
» On Skolemization in constructive theories
Sort
View
TIT
2008
110views more  TIT 2008»
15 years 6 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
JMIV
1998
112views more  JMIV 1998»
15 years 6 months ago
Differential and Integral Geometry of Linear Scale-Spaces
Linear scale-space theory provides a useful framework to quantify the differential and integral geometry of spatio-temporal input images. In this paper that geometry comes about by...
Alfons H. Salden, Bart M. ter Haar Romeny, Max A. ...
INFOCOM
2010
IEEE
15 years 5 months ago
Twister Networks and Their Applications to Load-Balanced Switches
Abstract—Inspired by the recent development of optical queueing theory, in this paper we study a class of multistage interconnection networks (MINs), called twister networks. Unl...
Ching-Ming Lien, Cheng-Shang Chang, Jay Cheng, Dua...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 6 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
POPL
2007
ACM
16 years 6 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell