Sciweavers

89 search results - page 16 / 18
» Topological Persistence and Simplification
Sort
View
ANCS
2009
ACM
13 years 5 months ago
Design of a scalable nanophotonic interconnect for future multicores
As communication-centric computing paradigm gathers momentum due to increased wire delays and excess power dissipation with technology scaling, researchers have focused their atte...
Avinash Karanth Kodi, Randy Morris
COMPGEOM
2011
ACM
12 years 11 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
INFOCOM
2003
IEEE
14 years 27 days ago
Analysis of Routing Characteristics in the Multicast Infrastructure
Abstract— As the multicast-capable part of the Internet continues to evolve, important questions to ask are whether the protocols are operating correctly, the topology is well co...
Prashant Rajvaidya, Kevin C. Almeroth
CGF
2011
12 years 11 months ago
Interactive Modeling of City Layouts using Layers of Procedural Content
In this paper, we present new solutions for the interactive modeling of city layouts that combine the power of procedural modeling with the flexibility of manual modeling. Proced...
Markus Lipp, Daniel Scherzer, Peter Wonka, Michael...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos