%PDF-1.4 5 0 obj << /S /GoTo /D (section.1) >> endobj 8 0 obj (Introduction and Motivation) endobj 9 0 obj << /S /GoTo /D (section.2) >> endobj 12 0 obj (Preliminaries) endobj 13 0 obj << /S /GoTo /D (section.3) >> endobj 16 0 obj (Basis Vectors) endobj 17 0 obj << /S /GoTo /D (section.4) >> endobj 20 0 obj (Decomposition of Basis Vectors) endobj 21 0 obj << /S /GoTo /D (subsection.4.1) >> endobj 24 0 obj (Inverse P-distance) endobj 25 0 obj << /S /GoTo /D (subsection.4.2) >> endobj 28 0 obj (Partial Vectors) endobj 29 0 obj << /S /GoTo /D (subsection.4.3) >> endobj 32 0 obj (Hubs Skeleton) endobj 33 0 obj << /S /GoTo /D (subsection.4.4) >> endobj 36 0 obj (Discussion) endobj 37 0 obj << /S /GoTo /D (subsubsection.4.4.1) >> endobj 40 0 obj (Summary) endobj 41 0 obj << /S /GoTo /D (subsubsection.4.4.2) >> endobj 44 0 obj (Choice of H) endobj 45 0 obj << /S /GoTo /D (subsubsection.4.4.3) >> endobj 48 0 obj (Web Skeleton) endobj 49 0 obj << /S /GoTo /D (section.5) >> endobj 52 0 obj (Computation) endobj 53 0 obj << /S /GoTo /D (subsection.5.1) >> endobj 56 0 obj (Decomposition Theorem) endobj 57 0 obj << /S /GoTo /D (subsection.5.2) >> endobj 60 0 obj (Algorithms for Computing Basis Vectors) endobj 61 0 obj << /S /GoTo /D (subsubsection.5.2.1) >> endobj 64 0 obj (Basic Dynamic Programming Algorithm) endobj 65 0 obj << /S /GoTo /D (subsubsection.5.2.2) >> endobj 68 0 obj (Selective Expansion Algorithm) endobj 69 0 obj << /S /GoTo /D (subsubsection.5.2.3) >> endobj 72 0 obj (Repeated Squaring Algorithm) endobj 73 0 obj << /S /GoTo /D (subsection.5.3) >> endobj 76 0 obj (Computing Partial Quantities) endobj 77 0 obj << /S /GoTo /D (subsubsection.5.3.1) >> endobj 80 0 obj (Partial Vectors) endobj 81 0 obj << /S /GoTo /D (subsubsection.5.3.2) >> endobj 84 0 obj (Hubs Skeleton) endobj 85 0 obj << /S /GoTo /D (subsubsection.5.3.3) >> endobj 88 0 obj (Web Skeleton) endobj 89 0 obj << /S /GoTo /D (subsection.5.4) >> endobj 92 0 obj (Construction of PPV's) endobj 93 0 obj << /S /GoTo /D (section.6) >> endobj 96 0 obj (Experiments) endobj 97 0 obj << /S /GoTo /D (subsection.6.1) >> endobj 100 0 obj (Computing Partial Vectors) endobj 101 0 obj << /S /GoTo /D (subsection.6.2) >> endobj 104 0 obj (Computing the Hubs Skeleton) endobj 105 0 obj << /S /GoTo /D (subsection.6.3) >> endobj 108 0 obj (Constructing Hub Vectors from Partial Vectors) endobj 109 0 obj << /S /GoTo /D (section.7) >> endobj 112 0 obj (Related Work) endobj 113 0 obj << /S /GoTo /D (section.8) >> endobj 116 0 obj (Summary) endobj 117 0 obj << /S /GoTo /D (section.9) >> endobj 120 0 obj (Acknowledgment) endobj 121 0 obj << /S /GoTo /D (section.A) >> endobj 124 0 obj (Proof: Linearity Theorem) endobj 125 0 obj << /S /GoTo /D (section.B) >> endobj 128 0 obj (Proof: Decomposition Theorem) endobj 129 0 obj << /S /GoTo /D (section.C) >> endobj 132 0 obj (Inverse P-distance) endobj 133 0 obj << /S /GoTo /D (subsection.C.1) >> endobj 136 0 obj (Relation to Personalized PageRank) endobj 137 0 obj << /S /GoTo /D (subsection.C.2) >> endobj 140 0 obj (Loop Factor) endobj 141 0 obj << /S /GoTo /D (section.D) >> endobj 144 0 obj (Proof: Hubs Theorem) endobj 145 0 obj << /S /GoTo /D (section.E) >> endobj 148 0 obj (Proof: Basic Dynamic Programming Algorithm) endobj 149 0 obj << /S /GoTo /D (section.F) >> endobj 152 0 obj (Proof: Selective Expansion Algorithm) endobj 153 0 obj << /S /GoTo /D (section.G) >> endobj 156 0 obj (Proof: Repeated Squaring Algorithm) endobj 157 0 obj << /S /GoTo /D (section.H) >> endobj 160 0 obj (Proof: Computation of Partial Vectors) endobj 161 0 obj << /S /GoTo /D (section.I) >> endobj 164 0 obj (Proof: Computation of the Hubs Skeleton) endobj 165 0 obj << /S /GoTo /D [166 0 R /FitH ] >> endobj 168 0 obj << /Length 2506 /Filter /FlateDecode >> stream xڍْ۸}o, H|l*ZW%qS( #1!Igk@hݐi/ D@+ AjdSn,MjRoFʮ6Yz{A Ϗ%^k8(PUٜv0V]|m#Cw|pyө_wQ`" a&LmX̀S8 2 C<1pǑ6j;4&a_ylkJ+ϸ=x& X{qN( wBDUE"C?ty1ܞAZ-M;{$BJVi d7Wf"54 ZsS~]|<˱J4 {cY8r9NU{66-qԖ0ΈOahv,;Ȍ{Y"g#CAc1L5A.aD ,P)߶-_vq Vl"h*.Upas͗M Ȟ:{4 xZݢ7D_tTؐL`78Me pϤ\`}5Ëᅃ +9d frreLoۅLl_9yK"-,/CMIw/@=Ogp(ZyDB8m!wOwFNDz7`fȫe_6N_{P^2NKpN3nVl