Sciweavers

723 search results - page 83 / 145
» Computationally Efficient Transductive Machines
Sort
View
EUROCRYPT
1995
Springer
14 years 18 days ago
Quantum Oblivious Mutual Identification
We coiisider a situation where two parties, Alice and Bob, share a common secret string arid would like to mutually check their knowledge of that string. We describe a simple and e...
Claude Crépeau, Louis Salvail
ICPR
2006
IEEE
14 years 10 months ago
Protein Fold Recognition using a Structural Hidden Markov Model
Protein fold recognition has been the focus of computational biologists for many years. In order to map a protein primary structure to its correct 3D fold, we introduce in this pa...
Djamel Bouchaffra, Jun Tan
SAMOS
2004
Springer
14 years 2 months ago
Self-loop Pipelining and Reconfigurable Dataflow Arrays
Abstract. This paper presents some interesting concepts of static dataflow machines that can be used by reconfigurable computing architectures. We introduce some data-driven reconf...
João M. P. Cardoso
SIGCOMM
2010
ACM
13 years 9 months ago
No more middlebox: integrate processing into network
Traditionally, in-network services like firewall, proxy, cache, and transcoders have been provided by dedicated hardware middleboxes. A recent trend has been to remove the middleb...
Jeongkeun Lee, Jean Tourrilhes, Puneet Sharma, Suj...
IPPS
2006
IEEE
14 years 3 months ago
Non-cooperative, semi-cooperative, and cooperative games-based grid resource allocation
In this paper we consider, compare and analyze three game theoretical Grid resource allocation mechanisms. Namely, 1) the non-cooperative sealed-bid method where tasks are auction...
Samee Ullah Khan, Ishfaq Ahmad