Poelstra, 2013 - Google Patents
On the topological and uniform structure of diversitiesPoelstra, 2013
View PDF- Document ID
- 13606788774587987107
- Author
- Poelstra A
- Publication year
- Publication venue
- Journal of Function Spaces
External Links
Snippet
Diversities have recently been developed as multiway metrics admitting clear and useful notions of hyperconvexity and tight span. In this note, we consider the analytical properties of diversities, in particular the generalizations of uniform continuity, uniform convergence …
- 230000001131 transforming 0 abstract description 2
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30958—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Naserasr et al. | Homomorphisms of signed graphs | |
| Lee et al. | Dirac's theorem for random graphs | |
| Karvelas et al. | Efficient proofs of secure erasure | |
| del Pino et al. | Raccoon: A masking-friendly signature proven in the probing model | |
| Döttling et al. | Obfuscation from low noise multilinear maps | |
| Ferber et al. | Finding Hamilton cycles in random graphs with few queries | |
| Dvořák et al. | List coloring with requests | |
| Yoo et al. | Disentangling degree-related biases and interest for out-of-distribution generalized directed network embedding | |
| Beullens et al. | Obfuscating simple functionalities from knowledge assumptions | |
| Dvořák et al. | A structure theorem for strong immersions | |
| Poelstra | On the topological and uniform structure of diversities | |
| Brewster et al. | Mixing homomorphisms, recolorings, and extending circular precolorings | |
| Maji et al. | Some New Upper Bounds for the Y‐Index of Graphs | |
| Harvey et al. | Treewidth of the line graph of a complete graph | |
| Galvin | Maximizing H‐Colorings of a Regular Graph | |
| Wiener | New constructions of hypohamiltonian and hypotraceable graphs | |
| Hajac et al. | A locally trivial quantum Hopf fibration | |
| Bang‐Jensen et al. | Bipartite spanning sub (di) graphs induced by 2‐partitions | |
| Gajarský et al. | First order limits of sparse graphs: Plane trees and path‐width | |
| Ebrahimzadeh et al. | On longest paths and diameter in random Apollonian networks | |
| Soukup | Orientations of graphs with uncountable chromatic number | |
| Kania et al. | A weak∗‐topological dichotomy with applications in operator theory | |
| Choromanski | Excluding pairs of tournaments | |
| Nazzal et al. | On the line graph of the zero divisor graph for the ring of Gaussian integers modulo n | |
| Chen et al. | Degree conditions for spanning brooms |