Results 1  10
of
19,391
Linklevel Measurements from an 802.11b Mesh Network
 In SIGCOMM
, 2004
"... This paper anal yzes the causes of packetl oss in a 38node urban mul tihop 802.11b network. The patterns and causes oflv# are important in the design of routing and errorcorrection proto colv as wel as in networkplqq"(v The paper makes the fol l owing observations. The distribution of intern ..."
Abstract

Cited by 567 (11 self)
 Add to MetaCart
This paper anal yzes the causes of packetl oss in a 38node urban mul tihop 802.11b network. The patterns and causes oflv# are important in the design of routing and errorcorrection proto colv as wel as in networkplqq"(v The paper makes the fol l owing observations. The distribution of inter
Sequence Logos: A New Way to Display Consensus Sequences
 Nucleic Acids Res
, 1990
"... INTRODUCTION A logo is "a single piece of type bearing two or more usually separate elements" [1]. In this paper, we use logos to display aligned sets of sequences. Sequence logos concentrate the following information into a single graphic [2]: 1. The general consensus of the sequences. ..."
Abstract

Cited by 650 (28 self)
 Add to MetaCart
. National Cancer Institute, Frederick Cancer Research and Development Center, Laboratory of Mathematical Biology, P. O. Box B, Frederick, MD 21701. Internet addresses: toms@ncifcrf.gov and stephens@ncifcrf.gov. y corresponding author 1 2. The order of predominance of the residues at every position. 3
Mediation in experimental and nonexperimental studies: new procedures and recommendations
 PSYCHOLOGICAL METHODS
, 2002
"... Mediation is said to occur when a causal effect of some variable X on an outcome Y is explained by some intervening variable M. The authors recommend that with small to moderate samples, bootstrap methods (B. Efron & R. Tibshirani, 1993) be used to assess mediation. Bootstrap tests are powerful ..."
Abstract

Cited by 696 (4 self)
 Add to MetaCart
Mediation is said to occur when a causal effect of some variable X on an outcome Y is explained by some intervening variable M. The authors recommend that with small to moderate samples, bootstrap methods (B. Efron & R. Tibshirani, 1993) be used to assess mediation. Bootstrap tests are powerful
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
X passes to its parent U; is given by: and the message X sends to its child Y j is given by: k;Cj For noisyor links between parents and children, there exists an analytic expression for 1r( x) and Ax ( u;) that avoids the exhaustive enumeration over parent config urations We made a slight
Similarity estimation techniques from rounding algorithms
 In Proc. of 34th STOC
, 2002
"... A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads ..."
Abstract

Cited by 449 (6 self)
 Add to MetaCart
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, Prh∈F[h(x) = h(y)] = sim(x,y), where sim(x,y) ∈ [0, 1] is some similarity function defined on the collection of objects. Such a scheme leads
On the bursty evolution of Blogspace
, 2003
"... O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +%&P &.F0, )& ;)S O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +% # O,<&7& =1 P &7"U;(Z ;>A@CB;D,[\D]K,D?^_ B`Bba]@C>Ac >AG8H$^2d)@C]E 9='0,*+82 &e " & Q (T0 U;Ub%&7*',#$ %& :3 Q ..."
Abstract

Cited by 365 (8 self)
 Add to MetaCart
Q+ #$ f" L ;&Vg"L0 ,M' (Fhji_E KkI+H$^2D9" 0 O (` lV P gmA)fn i_E K/o3qpr%+N8%+*s&#$ V# t /M &U5u 7*wv x)y z{V&.+L U; P x)z}l P 3~10/)O&U; P)2 "; b" l P l*` 5)% U5u&0 =)7*& ( U; 2890033320 3 &U;r82 U; 3!j" L8%=+*b
Testing for the equivalence of factor covariance and mean structures: The issue of partial measurement invariance
 Psychological Bulletin
, 1989
"... Addresses issues related to partial measurement in variance using a tutorial approach based on the LISREL confirmatory factor analytic model. Specifically, we demonstrate procedures for (a) using "sensitivity analyses " to establish stable and substantively wellfitting baseline models, (b ..."
Abstract

Cited by 261 (6 self)
 Add to MetaCart
, (b) determining partially invariant measurement parameters, and (c) testing for the invariance of factor covariance and mean structures, given partial measurement invariance. We also show, explicitly, the transformation of parameters from an all^fto an ally model specification, for purposes
The Decision DiffieHellman Problem
, 1998
"... The Decision DiffieHellman assumption (ddh) is a gold mine. It enables one to construct efficient cryptographic systems with strong security properties. In this paper we survey the recent applications of DDH as well as known results regarding its security. We describe some open problems in this are ..."
Abstract

Cited by 237 (7 self)
 Add to MetaCart
in this area. 1 Introduction An important goal of cryptography is to pin down the exact complexity assumptions used by cryptographic protocols. Consider the DiffieHellman key exchange protocol [12]: Alice and Bob fix a finite cyclic group G and a generator g. They respectively pick random a; b 2 [1; j
Supportvector machines for histogrambased image classification
 IEEE Transactions on Neural Networks
, 1999
"... Abstract — Traditional classification approaches generalize poorly on image classification tasks, because of the high dimensionality of the feature space. This paper shows that support vector machines (SVM’s) can generalize well on difficult image classification problems where the only features are ..."
Abstract

Cited by 229 (1 self)
 Add to MetaCart
are high dimensional histograms. Heavytailed RBF kernels of the form K(x;y) = e jx y j with a 1 and b 2 are evaluated on the classification of images extracted from the Corel stock photo collection and shown to far outperform traditional polynomial or Gaussian radial basis function (RBF) kernels
Lambda Lifting: Transforming Programs to Recursive Equations
, 1985
"... Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combinator) definitions which will be used as rewrite rules. Different ways of doing lambd ..."
Abstract

Cited by 218 (4 self)
 Add to MetaCart
and Computer Architecture, Lecture Notes in Computer Science 201, Nancy, France, 1985. Springer Verlag. y As part B of author's thesis. Main addition: the attribute grammar formulation. 1 Introduction When compiling a lazy functional language using the technique described in [Joh84] it is presumed
Results 1  10
of
19,391