Sciweavers

704 search results - page 40 / 141
» Isometrically Embedded Graphs
Sort
View
ICPR
2010
IEEE
13 years 5 months ago
Learning Scene Semantics Using Fiedler Embedding
We propose a framework to learn scene semantics from surveillance videos. Using the learnt scene semantics, a video analyst can efficiently and effectively retrieve the hidden sem...
Jingen Liu, Saad Ali
GC
2006
Springer
13 years 7 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
ISSS
1995
IEEE
100views Hardware» more  ISSS 1995»
13 years 11 months ago
Optimal code generation for embedded memory non-homogeneous register architectures
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
Guido Araujo, Sharad Malik
COMPGEOM
2004
ACM
14 years 1 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
COMPGEOM
2010
ACM
14 years 22 days ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar