Results 1  10
of
51,965
SplitStream: HighBandwidth Multicast in Cooperative Environments
 SOSP '03
, 2003
"... In treebased multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highly available, d d cated infrastructure routers but it poses a problem for applicationlevel multicast in peertopeer systems. ..."
Abstract

Cited by 578 (17 self)
 Add to MetaCart
forwarding bandH d th as it receives. Furthermore, with appropriate content encod ngs, SplitStream is highly robust to failures because a nod e fai ure causes the oss of a single stripe on average. We present thed#' gnand implementation of SplitStream and show experimental results obtained
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 961 (11 self)
 Add to MetaCart
polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. [8]. Its running time, measured in bit operations, is O(nl2+n9(log[fD3). Here f~Tl[X] is the polynomial
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 704 (6 self)
 Add to MetaCart
is applied to a molecular dynamics simulation of a liquid of 64 nbutane molecules and compared to a simulation using generalized coordinates. The method should be useful for molecular dynamics calculations on large molecules with internal degrees of freedom. 1. INTR~D~JCTI~N The method of molecular dynamics
Grounding in communication
 In
, 1991
"... We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let ..."
Abstract

Cited by 1122 (20 self)
 Add to MetaCart
We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 663 (38 self)
 Add to MetaCart
A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion
Rho GTPases and the actin cytoskeleton
 Science
, 1998
"... The actin cytoskeleton mediates a variety of essential biological functions in all eukaryotic cells. In addition to providing a structural framework around which cell shape and polarity are defined, its dynamic properties provide the driving force for cells to move and to divide. Understanding the b ..."
Abstract

Cited by 615 (4 self)
 Add to MetaCart
). In Swiss 3T3 fibroblasts, it was shown that Rho can be activated by the addition of extracellular ligands [for example, lysophosphatidic acid] and that Rho activation leads to the assembly of contractile actinmyosin filaments (stress fibers) and of associated focal adhesion complexes (Fig. 1, C and D) (1
Explaining Collaborative Filtering Recommendations
, 2000
"... $XWRPDWHG FROODERUDWLYH ILOWHULQJ #$&)# V\VWHPV SUHGLFW D SHUVRQV DIILQLW\ IRU LWHPV RU LQIRUPDWLRQ E\ FRQQHFWLQJ WKDW SHUVRQV UHFRUGHG LQWHUHVWV ZLWK WKH UHFRUGHG LQWHUHVWV RI D FRPPXQLW\ RI SHRSOH DQG VKDULQJ UDWLQJV EHWZHHQ OLNH# PLQGHG SHUVRQV# +RZHYHU# FXUUHQW UHFRPPHQGHU V\VWHPV DUH EODFN ..."
Abstract

Cited by 410 (17 self)
 Add to MetaCart
ER[HV# SURYLGLQJ QR WUDQVSDUHQF\ LQWR WKH ZRUNLQJ RI WKH UHFRPPHQGDWLRQ# ([SODQDWLRQV SURYLGH WKDW WUDQVSDUHQF\# H[SRVLQJ WKH UHDVRQLQJ DQG GDWD EHKLQG D UHFRPPHQGDWLRQ# ,Q WKLV SDSHU# ZH DGGUHVV H[SODQDWLRQ LQWHUIDFHV IRU $&) V\VWHPV KRZ#WKH\#VKRXOG#EH#LPSOHPHQWHG#DQG#ZK\#WKH\# VKRXOG
A Theory of Program Size Formally Identical to Information Theory
, 1975
"... A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1) ..."
Abstract

Cited by 380 (15 self)
 Add to MetaCart
A new definition of programsize complexity is made. H(A;B=C;D) is defined to be the size in bits of the shortest selfdelimiting program for calculating strings A and B if one is given a minimalsize selfdelimiting program for calculating strings C and D. This differs from previous definitions: (1
vic: A Flexible Framework for Packet Video
 ACM Multimedia
, 1995
"... The deployment of IP Multicast has fostered the development of a suite of applications, collectively known as the MBone tools, for realtime multimedia conferencingover the Internet. Two of these tools  nv from Xerox PARC and ivs from INRIA  provide video transmission using softwarebased codec ..."
Abstract

Cited by 369 (18 self)
 Add to MetaCart
, and support for diverse compression algorithms. We also propose a novel compression scheme called "IntraH. 261". Created as a hybrid of the nv and ivs codecs, IntraH. 261 provides a factor of 23 improvement in compression gain over the nv encoder (6 dB of PSNR) as well as a substantial improvement
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
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
Results 1  10
of
51,965