CSE 599 I : Geometric embeddings ( Winter 2007 ) Instructor :

نویسنده

  • James R. Lee
چکیده

(a) Show that the 3-pointed star metric (S, d) does not embed isometrically (i.e. with distortion 1) into `2. The star metric has four points S = {c, v1, v2, v3} (a center and 3 leaves) with d(c, vi) = 1 for i = 1, 2, 3 and d(vi, vj) = 2 for i 6= j. (b) Show that (S, d) does embed isometrically into `1. (c) Let T = (V, E) be a graph-theoretic tree, and let dT be the (unweighted) shortest path metric on T . Show that (V, dT ) embeds isometrically into ` |E| 1 .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CSE 599 i : Online and Adaptive Machine Learning Winter 2018 Lecture 6 : Non - stochastic best arm identification

Example 1. Imagine that we are solving a non-convex optimization problem on some (multivariate) function f using gradient descent. Recall that gradient descent converges to local minima. Because non-convex functions may have multiple minima, we cannot guarantee that gradient descent will converge to the global minimum. To resolve this issue, we will use random restarts, the process of starting ...

متن کامل

CSE 517: Natural Language Processing

Website: http://courses.cs.washington.edu/courses/cse517/16wi Lectures: Smith 102, Mondays and Wednesdays 1:30–2:50 pm Instructor: Noah A. Smith ([email protected]) Instructor office hours: CSE 532, Fridays 1:30–2:30 pm or by appointment Teaching assistants: Jesse Dodge ([email protected]) Eunsol Choi ([email protected]) Kenton Lee ([email protected]) TA office hours: CSE 220, Mo...

متن کامل

CSE 599 b : Cryptography ( Winter 2006 ) Lecture 6 : Collections of One - way Functions ; Candidates 20 January 2006

(0) Sampling: – There is a PPT CI that on input 1 produces an element of I ∩ {0, 1}. – There is a PPT CD that on input i ∈ I produces an element of Di. Note that neither CI nor CD is required to be uniform (or even have support that is all of I ∩ {0, 1} or Di respectively) so all we need is that CI and CD choose elements from the appropriate sets. (1) Easy to Compute: There is a deterministic p...

متن کامل

CSE 190A Project Proposal: 3D Photography

This paper presents a research proposal for CSE 190A: Projects in Vision and Learning, Winter 2007, on the subject of 3D photography. It addresses the objectives, datasets, milestones, and student qualifications for the project.

متن کامل

CSE 599 b : Cryptography ( Winter 2006 ) Lecture 4 : More Block Ciphers ; Pseudorandom Generators 13 January 2006

Given a single (M,C) pair with C = DESK(M) and the fact that DES has a key length of 56 bits and brute force key search will succeed on average in 2 trials to find a K ′ such that DESK′(M) = C; moreover it is unlikely that even two different keys will work for the single (M,C) pair since there are more ciphertexts than keys so almost surelyK ′ = K. More sophisticated attacks have been developed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007