Sciweavers

704 search results - page 101 / 141
» Isometrically Embedded Graphs
Sort
View
DATE
2002
IEEE
75views Hardware» more  DATE 2002»
15 years 4 months ago
System Design for Flexibility
With the term flexibility, we introduce a new design dimension of an embedded system that quantitatively characterizes its feasibility in implementing not only one, but possibly ...
Christian Haubelt, Jürgen Teich, Kai Richter,...
FSTTCS
2001
Springer
15 years 4 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
EJC
2007
14 years 11 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman
ICMS
2010
14 years 10 months ago
TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
Jan Reininghaus, David Günther, Ingrid Hotz, ...
COMPGEOM
2004
ACM
15 years 5 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky