Sciweavers

4171 search results - page 691 / 835
» Choice numbers of graphs
Sort
View
FPGA
2000
ACM
161views FPGA» more  FPGA 2000»
15 years 10 months ago
The effect of LUT and cluster size on deep-submicron FPGA performance and density
In this paper we revisit the FPGA architectural issue of the effect of logic block functionality on FPGA performance and density. In particular, in the context of lookup table, cl...
Elias Ahmed, Jonathan Rose
EUROCRYPT
1997
Springer
15 years 10 months ago
Oblivious Transfers and Privacy Amplification
Oblivious transfer (OT) is an important primitive in cryptography. In chosen one-out-of-two string OT, a sender offers two strings, one of which the other party, called the receive...
Gilles Brassard, Claude Crépeau
LICS
1991
IEEE
15 years 10 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
ASPLOS
2010
ACM
15 years 9 months ago
Decoupling contention management from scheduling
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
Ryan Johnson, Radu Stoica, Anastasia Ailamaki, Tod...
WSC
2007
15 years 8 months ago
Towards a conceptual framework for visual analytics of time and time-oriented data
Time is an important data dimension with distinct characteristics that is common across many application domains. This demands specialized methods in order to support proper analy...
Wolfgang Aigner, Alessio Bertone, Silvia Miksch, C...