84 results on '"convex polytope"'
Search Results
2. Polytope Membership in High Dimension
3. Achievability of Kinetic Energy Release in Wind Farm Active Power Control
4. On the Helly Dimension of Hanner Polytopes
5. The Nature and Structure of Feasible Sets
6. Structured Outlier Detection in Neuroimaging Studies with Minimal Convex Polytopes
7. Solid Angles
8. Disentangling Disease Heterogeneity with Max-Margin Multiple Hyperplane Classifier
9. Hybrid Sparse Linear and Lattice Method for Hyperspectral Image Unmixing
10. Hilbert’s third problem: decomposing polyhedra
11. Monotone Paths in Planar Convex Subdivisions and Polytopes
12. Greedy Sparsification WM Algorithm for Endmember Induction in Hyperspectral Images
13. Parameterized Weighted Containment
14. A Duality Transform for Constructing Small Grid Embeddings of 3D Polytopes
15. Examples and Exercises
16. Functions with Zero Integrals over Polytopes
17. Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
18. Chapter 2 Moments
19. Initialization of Nonnegative Matrix Factorization with Vertices of Convex Polytope
20. Realizing Planar Graphs as Convex Polytopes
21. Doubly Stochastic Matrices
22. Flux Measurement Selection in Metabolic Networks
23. A Framework for n-Dimensional Visibility Computations
24. Scaling Cautious Selection in Spatial Probabilistic Temporal Databases
25. A Simplex-Like Algorithm for Fisher Markets
26. Generalized Permutahedra
27. Integral Points in Polytopes
28. Five-Dimensional Euclidean Space Cannot be Conformly Partitioned into Acute Simplices
29. Hilbert’s third problem: decomposing polyhedra
30. The Borsuk Problem Conquered
31. Use of Finite Arithmetic in 3D Spatial Databases
32. The Linear Integration Problem I
33. Comparing the Continuous Problems P and I
34. Convexity
35. Convex Hulls : Mixing Things
36. Geometry-Free Geometric Computing
37. Morphing Planar Graphs in Spherical Space
38. Laplacian Sheep: A Hybrid, Stop-Go Policy for Leader-Based Containment Control
39. Lower Bounds for Geometric Diameter Problems
40. The Hadwiger Theorems
41. Convex Polytopes
42. Polytopic Approximations of Reachable Sets Applied to Linear Dynamic Games and a Class of Nonlinear Systems
43. Successive Linear Programs for Computing All Integral Points in a Minkowski Sum
44. A Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces
45. Testing Geometric Convexity
46. Hilbert’s third problem: decomposing polyhedra
47. Qualitative Infinite Version of Erdős’ Problem About Empty Polygons
48. What Was It About? An Informal Summary
49. Volumes in High Dimension
50. Volume computation for polytopes: strategies and performances Volume Computation for Polytopes: Strategies and Performances
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.