215 search results - page 31 / 43 » Approximating Geometrical Graphs via |
STACS
2001
Springer
14 years 2 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
ICIP
2006
IEEE
14 years 11 months ago
2006
IEEE
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
ISDA
2009
IEEE
14 years 4 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...