61 search results - page 12 / 13 » Embedding Graphs Containing K5-Subdivisions |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
CAD
2007
Springer
13 years 7 months ago
2007
Springer
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...
SIAMJO
2010
13 years 2 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
RTCSA
1999
IEEE
14 years 15 hour ago
1999
IEEE
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...