This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: R d . 4. Fixed d,generically classify : no solution, unique solution or nitely many solution. Note, in 3d, the above question is still open. Particularly, for what special class of graphs in d Dimension, we can classify it? For question 1, a randomized algorithm with high probability (1 ( | a | )), nds an appropriate P + realization in approximately (1+ ) d min dimension d by running time T ( | a | , 1 /, 1 , 1 / ). 1 3 Non-Distance Constraint Very specif graphs (regular graphs) 4 Questions and Discussion 1. How to generate a random subspace oF dimension d in R n ? or example, we can sample two angles For 3D. How to sample 2-d in R 4 ? 2. In 2-d, the lasgest m s.t. (1). m points and m lines s.t. every pair oF points is seperated by exactly m/2 lines; (2). or maximum m, fnd all such realization? Modulo what? 2...
View Full Document
This note was uploaded on 11/09/2011 for the course CIS 6930 taught by Professor Staff during the Fall '08 term at University of Florida.
- Fall '08