Find:

Searching for nb.

Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
3061 documents found. Only retrieving 250 documents (System busy - maximum reduced). Retrieving documents... Order: number of citations.

Tempest and Typhoon: User-Level Shared Memory - Reinhardt, Larus, Wood (1994)   (Correct)   (247 citations)
performs comparably (30%to an all-hardware Dir N NB cache-coherence protocol for five shared-memory
(30%to a conventional, all-hardware Dir N NB shared-memory system, despite Typhoon's greater
a conventional, all-hardware, directory-based Dir N NB cache-coherence protocol. Both systems are modeled
ftp.cs.wisc.edu/wwt/isca94_typhoon.ps

Robustness Principles for Public Key Protocols - Anderson, Needham (1995)   (Correct)   (97 citations)
the signed encrypted message would be: fM eB mod nB )g dA mod nA )1) This is vulnerable, and in a
vulnerable, and in a novel way. Since Bob can factor nB and its factors are only 250-300 bits long, he can
Remainder theorem to get discrete logs modulo nB .So if he wants to get Alice's `signature' on a
www.cl.cam.ac.uk/ftp/users/rja14/robustness.ps.Z

Cooperative Shared Memory: Software and Hardware for Scalable.. - Hill (1992)   (Correct)   (78 citations)
is comparable to a more complex protocol (Dir 32 NB )and that the CICO directives improve performance
of Agarwal, et al. 2]They use Dir i B and Dir i NB to stand for directories with i pointers that do or
directives, against their performance under Dir n NB. This protocol maintains a record of all
ftp.cs.wisc.edu/wwt/tocs93_csm.ps

Where is Time Spent in Message-Passing and Shared-Memory.. - Chandra, Larus, Rogers (1994)   (Correct)   (57 citations)
on the Wisconsin Wind Tunnel [19]We used its Dirn NB protocol simulation [1] as our cache-coherent
EM3D benefited the most from message passing. Dirn NB 's invalidation-based cachecoherence policy proved
machine uses the invalidationbased Dirn NB cache-coherence protocol [1]Each processor node's
ftp.cs.princeton.edu/techreports/1994/463.ps.Z

HTTP State Management Mechanism - Kristol, Montulli (1998)   (Correct)   (53 citations)
exactly or A is a HDN string and has the form NB, where N is a non-empty name string, B has the form
info.internet.isi.edu/0/in-drafts/files/draft-ietf-http-state-man-mec-10.ps

Comprehension Syntax - Buneman, Libkin, Suciu, Tannen, Wong (1994)   (Correct)   (42 citations)
A and B with f[A =a B 0 fb j [A =a B =nb] Gamma Rg] j A =na Gamma Rg 2
sdmc.krdl.org.sg/kleisli/psZ/blstwsigmodrecord94.ps

Increasing Availability and Security of an Authentication Service - Gong (1993)   (Correct)   (40 citations)
Protocol. 1. A !B :A B na 2. B !S :A B na nb 3. S !B :fB na KabgKa fA nb KabgKb 4. B !
! S :A B na nb 3. S !B :fB na KabgKa fA nb KabgKb 4. B !A :fB na KabgKa fnagKab nb
nb KabgKb 4. B !A :fB na KabgKa fnagKab nb 5. A !B :fnbg Kab In message 1 (or 2)A (or B)
www.csl.sri.com/~gong/papers/distributed-auth.ps.gz

Inductive Analysis of the Internet Protocol TLS - Paulson (1997)   (Correct)   (34 citations)
TLS 3 A,Na,Sid,Pa client server client hello Nb,Sid,Pb server hello cert(B,Kb) server
certificate {PMS} Kb client key exchange {Hash(Nb,B,PMS)Ka -1 certificate verify {Finished}
Ka -1 certificate verify {Finished} clientK(Na,Nb,M) client finished M =PRF(PMS,Na,Nb) Finished =
www.cl.cam.ac.uk/users/lcp/papers/tls.ps.gz

Exploration of the Power of Attribute-Oriented Induction in Data.. - Han, Fu (1996)   (Correct)   (32 citations)
Western Central Prairies Ontario Quebec B.c. Ns Nb Nfl Manitoba Alberta Canada Western Central
B.c. Alberta Mansas Ontario Quebec Maritime Nb Ns Nfl Saskatchewan Saskatchewan a) b) Figure
ftp.fas.sfu.ca/pub/cs/han/kdd/kdd95.ps

Congestion Control And Prevention In ATM Networks - Hong, Suda (1991)   (Correct)   (24 citations)
of the current narrowband ISDN which is based on an nB D time division multiplexed (TDM)
ftp.ics.uci.edu/pub/duke/netmag.ps.Z

Using One-Way Functions for Authentication - Gong (1989)   (Correct)   (24 citations)
1. A !B: A, B, na Message 2. B !S: A, B, na, nb Message 3. S !B: ns, f(ns, nb, A, Pb)Phi(k, ha,
2. B !S: A, B, na, nb Message 3. S !B: ns, f(ns, nb, A, Pb)Phi(k, ha, hb)g(k, ha, hb, Pb) Message 4.
1. A !B: A, B, na Bob responses by generating nonce nb and passing on the request to Sue. Message 2. B !
java.sun.com/people/gong/papers/one-way.ps.gz

Mellin Transforms and Asymptotics: The Mergesort Recurrence - Flajolet, Golin (1994)   (Correct)   (21 citations)
mergesort on n keys satisfies U(n) n lg n nB(lg n) o (n) where B(x) is a fractal-like
cost U(n) of Mergesort satisfies U(n) n lg n nB(lg n) O (1) where B(u) is a periodic function
from the first integral yields U(n) n lg n nB(lg n) O (n ffl 15) Note that I(s) does have
www.cecm.sfu.ca/mirror/INRIA/algo/flajolet/Publications/mellin-merge.ps.gz

Modeling Parallel Computers as Memory Hierarchies - Bowen Alpern (1993)   (Correct)   (20 citations)
[ABetc92]which include a blocking parameter NB that affects the size of submatrices that are
now.cs.berkeley.edu/clumps/pmh.ps

Specifications for Efficient Indexing in.. - Theodoridis.. (1998)   (Correct)   (20 citations)
are: Did any vessel cross any national boundary (NB i )on the 3rd of July?or "Is there any chance
River Rv? If Yes, When Did That Happen?a) A B Nb2 Iw Nb1 (b) Rv C 1 Rd Rd F 13 F12 F11 C Figure
Rv? If Yes, When Did That Happen?a) A B Nb2 Iw Nb1 (b) Rv C 1 Rd Rd F 13 F12 F11 C Figure 1: Two
skyblue.csd.auth.gr/right/../papers/Tr98-03.ps.gz

Time Abstracted Bisimulation: Implicit Specifications and.. - Kim Larsen (1993)   (Correct)   (20 citations)
of view, the behaviour of the combined system (A j B)nb is highly dependent on the timing parameters t a
as a proper (disposable) medium, i.e.A j B)nb ffl a:c:nil (1) where ffl denotes our
in fact the following will hold 3 A j B)nb ffl a:nil c:nil) a:c:nil (2) Even
www.docs.uu.se/docs/rtmv/papers/mfps93.ps.gz

Measurement-Based Usage Charges in Communications Networks - Courcoubetis, Kelly, Weber (1997)   (Correct)   (20 citations)
(at least locally) as a linear constraint nA ff A nB ff B C, where nA nB are the number of
a linear constraint nA ff A nB ff B C, where nA nB are the number of connections of types A and B, and
equilibrium, the overall social welfare, say u(nA nB )is maximized subject to this constraint. By
www.ics.forth.gr/proj/race/publications/./measurement_based_charging.ps.gz

Dag-Consistent Distributed Shared Memory - Blumofe, Frigo, Joerg.. (1996)   (Correct)   (20 citations)
the first block in each matrix as well as a variable nb denoting the number of blocks in any row or column
to the first block of a matrix and the value of nb, the location of any other block in the matrix can
of Cilk, see [17]1 cilk void matrixmul(long nb, shared block *A, shared block *B, shared block
eb-p5.eb.uah.edu/~kavi/CPE710/dag.ps

Using Genetic Algorithms for Robot Motion Planning - Ahuactzin, Talbi, Bessiere.. (1992)   (Correct)   (19 citations)
operation is used to produce two new individuals nb1 and nb2 .This operation consists of generating at
is used to produce two new individuals nb1 and nb2 .This operation consists of generating at random
part of b i with the right part of b j to obtain nb1 and to "glue" the right part of b i with the left
www-leibniz.imag.fr/LAPLACE/Membres/Pierre-Bessiere/../../Publications/Rayons/Ahuactzin92.ps.gz

Relations Between Secrets: Two Formal Analyses of the Yahalom.. - Paulson (1998)   (Correct)   (16 citations)
Between Keys and Nonces 9 8 Proving Secrecy of Nb 10 9 A Session Key Theorem for B 12 10 Analysis of
15 12 Conclusions 15 A Extracts from the Nb Secrecy Proof ii CONTENTS 1 1 Introduction
argument. It relies on the secrecy of the nonce Nb, which is encrypted using the very key in question
www.cl.cam.ac.uk/ftp/papers/reports/TR432-lcp-Yahalom.ps.gz

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC