Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
MDIC '01 Proceedings of the Second International Workshop on Multimedia Databases and Image Communication
COFE: A Scalable Method for Feature Extraction from Complex Objects
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Circular partitions with applications to visualization and embeddings
Proceedings of the twenty-fourth annual symposium on Computational geometry
Nearest neighbor search methods for handshape recognition
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Theoretical Computer Science
Triangulation and embedding using small sets of beacons
Journal of the ACM (JACM)
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
A survey on chromosomal structures and operators for exploiting topological linkages of genes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Many-to-many matching of scale-space feature hierarchies using metric embedding
Scale Space'03 Proceedings of the 4th international conference on Scale space methods in computer vision
A database-based framework for gesture recognition
Personal and Ubiquitous Computing
Almost-Euclidean subspaces of l1Nvia tensor products: a simple approach to randomness reduction
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Many-to-many graph matching via metric embedding
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Efficient many-to-many feature matching under the l1 norm
Computer Vision and Image Understanding
Proximity queries in time-dependent traffic networks using graph embeddings
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Empire of Colonies: self-stabilizing and self-organizing distributed algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On vertex sparsifiers with Steiner nodes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On dependent randomized rounding algorithms
Operations Research Letters
| Hi-index | 0.00 |
We explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the distances between their geometric images. We develop efficient algorithms for embedding graphs low-dimensionally with a small distortion.