Sciweavers

271 search results - page 47 / 55
» Logics from Galois connections
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
Channel-based Unidirectional Stream Protocol (CUSP)
—This paper presents a novel transport protocol, CUSP, specifically designed with complex and dynamic network applications in mind. Peer-to-peer applications benefit in particu...
Wesley W. Terpstra, Christof Leng, Max Lehn, Aleja...
CC
2010
Springer
282views System Software» more  CC 2010»
14 years 10 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks
FPGA
2011
ACM
330views FPGA» more  FPGA 2011»
14 years 3 months ago
CoRAM: an in-fabric memory architecture for FPGA-based computing
FPGAs have been used in many applications to achieve orders-of-magnitude improvement in absolute performance and energy efficiency relative to conventional microprocessors. Despit...
Eric S. Chung, James C. Hoe, Ken Mai
DAC
2012
ACM
13 years 2 months ago
A metric for layout-friendly microarchitecture optimization in high-level synthesis
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
Jason Cong, Bin Liu
CORR
1999
Springer
98views Education» more  CORR 1999»
14 years 11 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt